Travelled to:1 × Canada
3 × USA
Collaborated with:J.Cheriyan S.Vempala P.Donovan F.B.Shepherd G.T.Wilfong J.Chen R.D.Kleinberg L.Lovász R.Rajaraman R.Sundaram
Talks about:algorithm (2) approxim (2) network (2) flow (2) cost (2) constrain (1) confluent (1) subgraph (1) theorem (1) minimum (1)
Person: Adrian Vetta
DBLP: Vetta:Adrian
Contributed to:
2007200520042002Wrote 4 papers:
- STOC-2007-DonovanSVW #network
- Degree-constrained network flows (PD, FBS, AV, GTW), pp. 681–688.
- STOC-2005-CheriyanV #algorithm #approximate #design #metric #network
- Approximation algorithms for network design with metric costs (JC, AV), pp. 167–175.
- STOC-2004-ChenKLRSV #bound #confluence #theorem
- (Almost) tight bounds and existence theorems for confluent flows (JC, RDK, LL, RR, RS, AV), pp. 529–538.
- STOC-2002-CheriyanVV #algorithm #approximate #low cost
- Approximation algorithms for minimum-cost k-vertex connected subgraphs (JC, SV, AV), pp. 306–312.