Travelled to:1 × Denmark
1 × France
1 × Greece
1 × Latvia
1 × Portugal
1 × United Kingdom
9 × USA
Collaborated with:A.Kumar V.Nagarajan R.Ravi K.Talwar M.Pál R.Krishnaswamy K.Lewi É.Tardos ∅ N.Bansal G.Guruganesh U.Wieder A.Gu D.Witmer K.Pruhs T.Roughgarden M.A.Babenko A.V.Goldberg M.Hardt A.Roth J.Ullman A.Sinha I.Abraham C.Gavoille O.Neiman J.M.Kleinberg R.Rastogi B.Yener
Talks about:algorithm (8) approxim (6) optim (5) stochast (4) steiner (4) problem (4) network (4) onlin (4) tree (4) constant (3)
Person: Anupam Gupta
DBLP: Gupta:Anupam
Contributed to:
2015
20142014201320132012201120102009200520042003200120001999Wrote 21 papers:
- STOC-2015-BansalGG #graph #independence #on the #set
- On the Lovász Theta function for Independent Sets in Sparse Graphs (NB, AG, GG), pp. 193–200.
- STOC-2015-Gupta0 #algorithm
- Greedy Algorithms for Steiner Forest (AG, AK), pp. 871–878.
- ICALP-v1-2014-GuptaTW #multi #optimisation
- Changing Bases: Multistage Optimization for Matroids and Matchings (AG, KT, UW), pp. 563–575.
- STOC-2014-AbrahamGGNT #composition #graph
- Cops, robbers, and threatening skeletons: padded decomposition for minor-free graphs (IA, CG, AG, ON, KT), pp. 79–88.
- ICALP-v1-2013-BabenkoGGN #algorithm #optimisation
- Algorithms for Hub Label Optimization (MAB, AVG, AG, VN), pp. 69–80.
- STOC-2013-GuGK #maintenance #online #power of
- The power of deferral: maintaining a constant-competitive steiner tree online (AG, AG, AK), pp. 525–534.
- STOC-2013-GuptaTW #algorithm #bound #graph
- Sparsest cut on bounded treewidth graphs: algorithms and hardness results (AG, KT, DW), pp. 281–290.
- ICALP-v1-2012-GuptaL #metric #online #problem
- The Online Metric Matching Problem for Doubling Metrics (AG, KL), pp. 424–435.
- ICALP-v1-2012-GuptaN #approximate #integer #online #source code
- Approximating Sparse Covering Integer Programs Online (AG, VN), pp. 436–448.
- STOC-2011-GuptaHRU #query #statistics
- Privately releasing conjunctions and the statistical query barrier (AG, MH, AR, JU), pp. 803–812.
- ICALP-v1-2010-GuptaKP #scheduling
- Scalably Scheduling Power-Heterogeneous Processors (AG, RK, KP), pp. 312–323.
- ICALP-v1-2010-GuptaNR #algorithm #optimisation #robust
- Thresholded Covering Algorithms for Robust and Max-min Optimization (AG, VN, RR), pp. 262–274.
- ICALP-v1-2010-GuptaNR10a #adaptation #algorithm #approximate #problem
- Approximation Algorithms for Optimal Decision Trees and Adaptive TSP Problems (AG, VN, RR), pp. 690–701.
- STOC-2009-GuptaK #approximate #probability
- A constant-factor approximation for stochastic Steiner forest (AG, AK), pp. 659–668.
- STOC-2009-GuptaKR #design #network #online #probability
- Online and stochastic survivable network design (AG, RK, RR), pp. 685–694.
- ICALP-2005-GuptaP #probability
- Stochastic Steiner Trees Without a Root (AG, MP), pp. 1051–1063.
- STOC-2004-GuptaPRS #algorithm #approximate #optimisation #probability
- Boosted sampling: approximation algorithms for stochastic optimization (AG, MP, RR, AS), pp. 417–426.
- STOC-2003-GuptaKR #algorithm #approximate #design #network
- Simpler and better approximation algorithms for network design (AG, AK, TR), pp. 365–372.
- STOC-2001-GuptaKKRY #design #multi #network #problem
- Provisioning a virtual private network: a network design problem for multicommodity flow (AG, JMK, AK, RR, BY), pp. 389–398.
- STOC-2000-GuptaT #algorithm #approximate #classification #constant #problem
- A constant factor approximation algorithm for a class of classification problems (AG, ÉT), pp. 652–658.
- STOC-1999-Gupta #metric
- Embedding Tree Metrics Into Low Dimensional Euclidean Spaces (AG), pp. 694–700.