Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Anupam Gupta
2010 – today
- 2013
[j34]Maria-Florina Balcan, Avrim Blum, Anupam Gupta: Clustering under approximation stability. J. ACM 60(2): 8 (2013)- [c98]Marek Cygan, Matthias Englert, Anupam Gupta, Marcin Mucha, Piotr Sankowski: Catch them if you can: how to serve impatient users. ITCS 2013: 485-494
- [c97]Michael Dinitz, Anupam Gupta: Packing Interdiction and Partial Covering Problems. IPCO 2013: 157-168
- [c96]Zachary Friggstad, Anupam Gupta, Mohit Singh: An Improved Integrality Gap for Asymmetric TSP Paths. IPCO 2013: 181-192
- [c95]Anupam Gupta, Viswanath Nagarajan: A Stochastic Probing Problem with Applications. IPCO 2013: 205-216
- [c94]Anupam Gupta, Viswanath Nagarajan, Vijay V. Vazirani: Thrifty Algorithms for Multistage Robust Optimization. IPCO 2013: 217-228
- [c93]Avrim Blum, Anupam Gupta, Ariel D. Procaccia, Ankit Sharma: Harnessing the power of two crossmatches. ACM Conference on Electronic Commerce 2013: 123-140
- [c92]Anupam Gupta, Kunal Talwar, David Witmer: Sparsest cut on bounded treewidth graphs: algorithms and hardness results. STOC 2013: 281-290
- [c91]Albert Gu, Anupam Gupta, Amit Kumar: The power of deferral: maintaining a constant-competitive steiner tree online. STOC 2013: 525-534
- [i24]Zachary Friggstad, Anupam Gupta, Mohit Singh: An Improved Integrality Gap for Asymmetric TSP Paths. CoRR abs/1302.3145 (2013)
- [i23]Anupam Gupta, Viswanath Nagarajan, Vijay V. Vazirani: Thrifty Algorithms for Multistage Robust Optimization. CoRR abs/1302.5445 (2013)
- [i22]Anupam Gupta, Viswanath Nagarajan: A Stochastic Probing Problem with Applications. CoRR abs/1302.5913 (2013)
- [i21]Anupam Gupta, Kunal Talwar, David Witmer: Sparsest Cut on Bounded Treewidth Graphs: Algorithms and Hardness Results. CoRR abs/1305.1347 (2013)
- 2012
- [j33]Nikhil Bansal, Anupam Gupta, Jian Li, Julián Mestre, Viswanath Nagarajan, Atri Rudra: When LP Is the Cure for Your Matching Woes: Improved Bounds for Stochastic Matchings. Algorithmica 63(4): 733-762 (2012)
- [j32]Anupam Gupta, Viswanath Nagarajan, R. Ravi: Technical Note - Approximation Algorithms for VRP with Stochastic Demands. Operations Research 60(1): 123-127 (2012)
- [j31]T.-H. Hubert Chan, Anupam Gupta: Approximating TSP on Metrics with Bounded Global Growth. SIAM J. Comput. 41(3): 587-617 (2012)
- [j30]Anupam Gupta, Ravishankar Krishnaswamy, R. Ravi: Online and Stochastic Survivable Network Design. SIAM J. Comput. 41(6): 1649-1672 (2012)
- [c90]Sanjiban Sekhar Roy, Anupam Gupta, Anvesha Sinha, Rohit Ramesh: Cancer data investigation using variable precision Rough set with flexible classification. CCSEIT 2012: 472-475
- [c89]Anupam Gupta, Kevin Lewi: The Online Metric Matching Problem for Doubling Metrics. ICALP (1) 2012: 424-435
- [c88]Anupam Gupta, Viswanath Nagarajan: Approximating Sparse Covering Integer Programs Online. ICALP (1) 2012: 436-448
- [c87]Nikhil Bansal, Anupam Gupta, Ravishankar Krishnaswamy, Viswanath Nagarajan, Kirk Pruhs, Cliff Stein: Multicast Routing for Energy Minimization Using Speed Scaling. MedAlg 2012: 37-51
- [c86]Anupam Gupta, Sungjin Im, Ravishankar Krishnaswamy, Benjamin Moseley, Kirk Pruhs: Scheduling heterogeneous processors isn't as easy as you think. SODA 2012: 1242-1253
- [c85]Anupam Gupta, Ravishankar Krishnaswamy, Viswanath Nagarajan, R. Ravi: Approximation algorithms for stochastic orienteering. SODA 2012: 1522-1538
- [c84]Guy E. Blelloch, Anupam Gupta, Kanat Tangwongsan: Parallel probabilistic tree embeddings, k-median, and buy-at-bulk network design. SPAA 2012: 205-213
- [c83]Anupam Gupta, Aaron Roth, Jonathan Ullman: Iterative Constructions and Private Data Release. TCC 2012: 339-356
- [c82]Anupam Gupta, Ravishankar Krishnaswamy, Kirk Pruhs: Online Primal-Dual for Non-linear Optimization with Applications to Speed Scaling. WAOA 2012: 173-186
- [e1]Anupam Gupta, Klaus Jansen, José D. P. Rolim, Rocco A. Servedio (Eds.): Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques - 15th International Workshop, APPROX 2012, and 16th International Workshop, RANDOM 2012, Cambridge, MA, USA, August 15-17, 2012. Proceedings. Lecture Notes in Computer Science 7408, Springer 2012, ISBN 978-3-642-32511-3
- [i20]Anupam Gupta, Viswanath Nagarajan: Approximating Sparse Covering Integer Programs Online. CoRR abs/1205.0175 (2012)
- 2011
- [j29]
- [j28]Han Liu, Min Xu, Haijie Gu, Anupam Gupta, John D. Lafferty, Larry A. Wasserman: Forest Density Estimation. Journal of Machine Learning Research 12: 907-951 (2011)
- [j27]Anupam Gupta, Martin Pál, R. Ravi, Amitabh Sinha: Sampling and Cost-Sharing: Approximation Algorithms for Stochastic Optimization Problems. SIAM J. Comput. 40(5): 1361-1401 (2011)
- [j26]Andreas Krause, Ram Rajagopal, Anupam Gupta, Carlos Guestrin: Simultaneous Optimization of Sensor Placements and Balanced Schedules. IEEE Trans. Automat. Contr. 56(10): 2390-2405 (2011)
- [j25]Chandra Chekuri, Guy Even, Anupam Gupta, Danny Segev: Set connectivity problems in undirected graphs and the directed steiner network problem. ACM Transactions on Algorithms 7(2): 18 (2011)
- [j24]Andreas Krause, Carlos Guestrin, Anupam Gupta, Jon M. Kleinberg: Robust sensor placements at informative and communication-efficient locations. TOSN 7(4): 31 (2011)
- [c81]Avrim Blum, Anupam Gupta, Yishay Mansour, Ankit Sharma: Welfare and Profit Maximization with Production Costs. FOCS 2011: 77-86
- [c80]Anupam Gupta, Ravishankar Krishnaswamy, Marco Molinaro, R. Ravi: Approximation Algorithms for Correlated Knapsacks and Non-martingale Bandits. FOCS 2011: 827-836
- [c79]Guy E. Blelloch, Anupam Gupta, Ioannis Koutis, Gary L. Miller, Richard Peng, Kanat Tangwongsan: Near linear-work parallel SDD solvers, low-diameter decomposition, and low-stretch subgraphs. SPAA 2011: 13-22
- [c78]Anupam Gupta, Moritz Hardt, Aaron Roth, Jonathan Ullman: Privately releasing conjunctions and the statistical query barrier. STOC 2011: 803-812
- [i19]Anupam Gupta, Ravishankar Krishnaswamy, Marco Molinaro, R. Ravi: Approximation Algorithms for Correlated Knapsacks and Non-Martingale Bandits. CoRR abs/1102.3749 (2011)
- [i18]Anupam Gupta, Ravishankar Krishnaswamy, Kirk Pruhs: Scalably Scheduling Power-Heterogeneous Processors. CoRR abs/1105.3748 (2011)
- [i17]Anupam Gupta, Aaron Roth, Jonathan Ullman: Iterative Constructions and Private Data Release. CoRR abs/1107.3731 (2011)
- [i16]Anupam Gupta, Ravishankar Krishnaswamy, Kirk Pruhs: Online Primal-Dual For Non-linear Optimization with Applications to Speed Scaling. CoRR abs/1109.5931 (2011)
- [i15]Avrim Blum, Anupam Gupta, Yishay Mansour, Ankit Sharma: Welfare and Profit Maximization with Production Costs. CoRR abs/1110.4992 (2011)
- [i14]Guy E. Blelloch, Anupam Gupta, Ioannis Koutis, Gary L. Miller, Richard Peng, Kanat Tangwongsan: Near Linear-Work Parallel SDD Solvers, Low-Diameter Decomposition, and Low-Stretch Subgraphs. CoRR abs/1111.1750 (2011)
- 2010
- [j23]T.-H. Hubert Chan, Anupam Gupta, Kunal Talwar: Ultra-low-dimensional embeddings for doubling metrics. J. ACM 57(4) (2010)
- [j22]Barbara M. Anthony, Vineet Goyal, Anupam Gupta, Viswanath Nagarajan: A Plant Location Guide for the Unsure: Approximation Algorithms for Min-Max Location Problems. Math. Oper. Res. 35(1): 79-101 (2010)
- [j21]Anupam Gupta, Viswanath Nagarajan, R. Ravi: An improved approximation algorithm for requirement cut. Oper. Res. Lett. 38(4): 322-325 (2010)
- [j20]Anupam Gupta, Mohammad Taghi Hajiaghayi, Viswanath Nagarajan, R. Ravi: Dial a Ride from k-forest. ACM Transactions on Algorithms 6(2) (2010)
- [c77]Matthias Englert, Anupam Gupta, Robert Krauthgamer, Harald Räcke, Inbal Talgam-Cohen, Kunal Talwar: Vertex Sparsifiers: New Results from Old Techniques. APPROX-RANDOM 2010: 152-165
- [c76]Anupam Gupta, John D. Lafferty, Han Liu, Larry A. Wasserman, Min Xu: Forest Density Estimation. COLT 2010: 394-406
- [c75]Vyas Sekar, Anupam Gupta, Mike K. Reiter, Hui Zhang: Coordinated sampling sans Origin-Destination identifiers: Algorithms and analysis. COMSNETS 2010: 1-10
- [c74]Vyas Sekar, Ravishankar Krishnaswamy, Anupam Gupta, Michael K. Reiter: Network-wide deployment of intrusion detection and prevention systems. CoNEXT 2010: 18
- [c73]Nikhil Bansal, Anupam Gupta, Jian Li, Julián Mestre, Viswanath Nagarajan, Atri Rudra: When LP Is the Cure for Your Matching Woes: Improved Bounds for Stochastic Matchings - (Extended Abstract). ESA (2) 2010: 218-229
- [c72]Anupam Gupta, Ravishankar Krishnaswamy, Kirk Pruhs: Nonclairvoyantly scheduling power-heterogeneous processors. Green Computing Conference 2010: 165-173
- [c71]Anupam Gupta, Viswanath Nagarajan, R. Ravi: Thresholded Covering Algorithms for Robust and Max-min Optimization. ICALP (1) 2010: 262-274
- [c70]Anupam Gupta, Ravishankar Krishnaswamy, Kirk Pruhs: Scalably Scheduling Power-Heterogeneous Processors. ICALP (1) 2010: 312-323
- [c69]Anupam Gupta, Viswanath Nagarajan, R. Ravi: Approximation Algorithms for Optimal Decision Trees and Adaptive TSP Problems. ICALP (1) 2010: 690-701
- [c68]Anupam Gupta, Katrina Ligett, Frank McSherry, Aaron Roth, Kunal Talwar: Differentially Private Combinatorial Optimization. SODA 2010: 1106-1125
- [c67]Anupam Gupta, Ravishankar Krishnaswamy, R. Ravi: Tree Embeddings for Two-Edge-Connected Network Design. SODA 2010: 1521-1538
- [c66]Nikhil Bansal, Anupam Gupta, Ravishankar Krishnaswamy: A Constant Factor Approximation Algorithm for Generalized Min-Sum Set Cover. SODA 2010: 1539-1545
- [c65]Anupam Gupta, Sungjin Im, Ravishankar Krishnaswamy, Benjamin Moseley, Kirk Pruhs: Scheduling jobs with varying parallelizability to reduce variance. SPAA 2010: 11-20
- [c64]Anupam Gupta, Aaron Roth, Grant Schoenebeck, Kunal Talwar: Constrained Non-monotone Submodular Maximization: Offline and Secretary Algorithms. WINE 2010: 246-257
- [i13]Nikhil Bansal, Anupam Gupta, Viswanath Nagarajan, Atri Rudra: When LP is the Cure for Your Matching Woes: Approximating Stochastic Matchings. CoRR abs/1003.0167 (2010)
- [i12]Anupam Gupta, Ravishankar Krishnaswamy, Viswanath Nagarajan, R. Ravi: Approximation Algorithms for Optimal Decision Trees and Adaptive TSP Problems. CoRR abs/1003.0722 (2010)
- [i11]Anupam Gupta, Aaron Roth, Grant Schoenebeck, Kunal Talwar: Constrained Non-Monotone Submodular Maximization: Offline and Secretary Algorithms. CoRR abs/1003.1517 (2010)
- [i10]Matthias Englert, Anupam Gupta, Robert Krauthgamer, Harald Räcke, Inbal Talgam-Cohen, Kunal Talwar: Vertex Sparsifiers: New Results from Old Techniques. CoRR abs/1006.4586 (2010)
- [i9]Nikhil Bansal, Anupam Gupta, Jian Li, Julián Mestre, Viswanath Nagarajan, Atri Rudra: When LP is the Cure for Your Matching Woes: Improved Bounds for Stochastic Matchings. CoRR abs/1008.5356 (2010)
- [i8]Anupam Gupta, Moritz Hardt, Aaron Roth, Jonathan Ullman: Privately Releasing Conjunctions and the Statistical Query Barrier. CoRR abs/1011.1296 (2010)
- [i7]Anupam Gupta, Viswanath Nagarajan, R. Ravi: Robust and MaxMin Optimization under Matroid and Knapsack Uncertainty Sets. CoRR abs/1012.4962 (2010)
2000 – 2009
- 2009
- [j19]T.-H. Hubert Chan, Anupam Gupta: Small Hop-diameter Sparse Spanners for Doubling Metrics. Discrete & Computational Geometry 41(1): 28-44 (2009)
- [j18]T.-H. Hubert Chan, Kedar Dhamdhere, Anupam Gupta, Jon M. Kleinberg, Aleksandrs Slivkins: Metric Embeddings with Relaxed Guarantees. SIAM J. Comput. 38(6): 2303-2329 (2009)
- [c63]Anupam Gupta, Ravishankar Krishnaswamy, Amit Kumar, Danny Segev: Scheduling with Outliers. APPROX-RANDOM 2009: 149-162
- [c62]Andreas Krause, Ram Rajagopal, Anupam Gupta, Carlos Guestrin: Simultaneous placement and scheduling of sensors. IPSN 2009: 181-192
- [c61]Maria-Florina Balcan, Avrim Blum, Anupam Gupta: Approximate clustering without the approximation. SODA 2009: 1068-1077
- [c60]Moshe Babaioff, Michael Dinitz, Anupam Gupta, Nicole Immorlica, Kunal Talwar: Secretary problems: weights and discounts. SODA 2009: 1245-1254
- [c59]Anupam Gupta, Amit Kumar: A constant-factor approximation for stochastic Steiner forest. STOC 2009: 659-668
- [c58]Anupam Gupta, Ravishankar Krishnaswamy, R. Ravi: Online and stochastic survivable network design. STOC 2009: 685-694
- [i6]Anupam Gupta, Katrina Ligett, Frank McSherry, Aaron Roth, Kunal Talwar: Differentially Private Approximation Algorithms. CoRR abs/0903.4510 (2009)
- [i5]Anupam Gupta, Ravishankar Krishnaswamy, Amit Kumar, Danny Segev: Scheduling with Outliers. CoRR abs/0906.2020 (2009)
- [i4]Anupam Gupta, Viswanath Nagarajan, R. Ravi: Thresholded Covering Algorithms for Robust and Max-Min Optimization. CoRR abs/0912.1045 (2009)
- 2008
- [j17]Anupam Gupta, Aravind Srinivasan, Éva Tardos: Cost-Sharing Mechanisms for Network Design. Algorithmica 50(1): 98-119 (2008)
- [j16]Shuchi Chawla, Anupam Gupta, Harald Räcke: Embeddings of negative-type metrics and an improved approximation to generalized sparsest cut. ACM Transactions on Algorithms 4(2) (2008)
- [j15]Julia Chuzhoy, Anupam Gupta, Joseph Naor, Amitabh Sinha: On the approximability of some network design problems. ACM Transactions on Algorithms 4(2) (2008)
- [j14]Anupam Gupta, Ziv Bar-Joseph: Extracting Dynamics from Static Cancer Expression Data. IEEE/ACM Trans. Comput. Biology Bioinform. 5(2): 172-182 (2008)
- [c57]Fabrizio Grandoni, Anupam Gupta, Stefano Leonardi, Pauli Miettinen, Piotr Sankowski, Mohit Singh: Set Covering with our Eyes Closed. FOCS 2008: 347-356
- [c56]Daniel Golovin, Anupam Gupta, Amit Kumar, Kanat Tangwongsan: All-Norms and All-L_p-Norms Approximation Algorithms. FSTTCS 2008: 199-210
- [c55]
- [c54]T.-H. Hubert Chan, Anupam Gupta, Kunal Talwar: Ultra-low-dimensional embeddings for doubling metrics. SODA 2008: 333-342
- [c53]Chandra Chekuri, Guy Even, Anupam Gupta, Danny Segev: Set connectivity problems in undirected graphs and the directed Steiner network problem. SODA 2008: 532-541
- [c52]T.-H. Hubert Chan, Anupam Gupta: Approximating TSP on metrics with bounded global growth. SODA 2008: 690-699
- [c51]Naveen Garg, Anupam Gupta, Stefano Leonardi, Piotr Sankowski: Stochastic analyses for online combinatorial optimization problems. SODA 2008: 942-951
- [c50]Barbara M. Anthony, Vineet Goyal, Anupam Gupta, Viswanath Nagarajan: A plant location guide for the unsure. SODA 2008: 1164-1173
- [i3]Anupam Gupta, Kanat Tangwongsan: Simpler Analyses of Local Search Algorithms for Facility Location. CoRR abs/0809.2554 (2008)
- 2007
- [j13]Amit Chakrabarti, Chandra Chekuri, Anupam Gupta, Amit Kumar: Approximation Algorithms for the Unsplittable Flow Problem. Algorithmica 47(1): 53-78 (2007)
- [j12]Anupam Gupta, Amit Kumar, Martin Pál, Tim Roughgarden: Approximation via cost sharing: Simpler and better approximation algorithms for network design. J. ACM 54(3): 11 (2007)
- [j11]Anupam Gupta, R. Ravi, Amitabh Sinha: LP Rounding Approximation Algorithms for Stochastic Network Design. Math. Oper. Res. 32(2): 345-364 (2007)
- [c49]Anupam Gupta, MohammadTaghi Hajiaghayi, Amit Kumar: Stochastic Steiner Tree with Non-uniform Inflation. APPROX-RANDOM 2007: 134-148
- [c48]Yuri Breitbart, Minos N. Garofalakis, Anupam Gupta, Amit Kumar, Rajeev Rastogi: On Configuring BGP Route Reflectors. COMSWARE 2007
- [c47]Anupam Gupta, MohammadTaghi Hajiaghayi, Viswanath Nagarajan, R. Ravi: Dial a Ride from k -Forest. ESA 2007: 241-252
- [c46]Vineet Goyal, Anupam Gupta, Stefano Leonardi, R. Ravi: Pricing Tree Access Networks with Connected Backbones. ESA 2007: 498-509
- [c45]Nikhil Bansal, Niv Buchbinder, Anupam Gupta, Joseph Naor: An O (log2 k )-Competitive Algorithm for Metric Bipartite Matching. ESA 2007: 522-533
- [c44]
- [c43]Andreas Krause, H. Brendan McMahan, Carlos Guestrin, Anupam Gupta: Selecting Observations against Adversarial Objectives. NIPS 2007
- [c42]Anupam Gupta, Jochen Könemann, Stefano Leonardi, R. Ravi, Guido Schäfer: An efficient cost-sharing mechanism for the prize-collecting Steiner forest problem. SODA 2007: 1153-1162
- [i2]Anupam Gupta, MohammadTaghi Hajiaghayi, Viswanath Nagarajan, R. Ravi: Dial a Ride from k-forest. CoRR abs/0707.0648 (2007)
- [i1]
- 2006
- [j10]Kedar Dhamdhere, Anupam Gupta, R. Ravi: Approximation Algorithms for Minimizing Average Distortion. Theory Comput. Syst. 39(1): 93-111 (2006)
- [j9]Chandra Chekuri, Anupam Gupta, Ilan Newman, Yuri Rabinovich, Alistair Sinclair: Embedding k-Outerplanar Graphs into l 1. SIAM J. Discrete Math. 20(1): 119-136 (2006)
- [j8]Anupam Gupta, Aravind Srinivasan: An Improved Approximation Ratio for the Covering Steiner Problem. Theory of Computing 2(1): 53-64 (2006)
- [c41]
- [c40]Andreas Krause, Carlos Guestrin, Anupam Gupta, Jon M. Kleinberg: Near-optimal sensor placements: maximizing information while minimizing communication cost. IPSN 2006: 2-10
- [c39]Daniel Golovin, Anupam Gupta, Bruce M. Maggs, Florian Oprea, Michael K. Reiter: Quorum placement in networks: minimizing network congestion. PODC 2006: 16-25
- [c38]Kedar Dhamdhere, Anupam Gupta, Harald Räcke: Improved embeddings of graph metrics into random trees. SODA 2006: 61-69
- [c37]Hubert T.-H. Chan, Anupam Gupta: Small hop-diameter sparse spanners for doubling metrics. SODA 2006: 70-78
- [c36]
- [c35]
- 2005
- [j7]Chandra Chekuri, Anupam Gupta, Amit Kumar, Joseph Naor, Danny Raz: Building Edge-Failure Resilient Networks. Algorithmica 43(1-2): 17-41 (2005)
- [j6]Chandra Chekuri, Anupam Gupta, Amit Kumar: On a bidirected relaxation for the MULTIWAY CUT problem. Discrete Applied Mathematics 150(1-3): 67-79 (2005)
- [c34]Anupam Gupta, Amit Kumar: Where's the Winner? Max-Finding and Sorting with Metric Costs. APPROX-RANDOM 2005: 74-85
- [c33]Anupam Gupta, Martin Pál, R. Ravi, Amitabh Sinha: What About Wednesday? Approximation Algorithms for Multistage Stochastic Optimization. APPROX-RANDOM 2005: 86-98
- [c32]Ittai Abraham, Yair Bartal, Hubert T.-H. Chan, Kedar Dhamdhere, Anupam Gupta, Jon M. Kleinberg, Ofer Neiman, Aleksandrs Slivkins: Metric Embeddings with Relaxed Guarantees. FOCS 2005: 83-100
- [c31]
- [c30]Anupam Gupta, Bruce M. Maggs, Florian Oprea, Michael K. Reiter: Quorum placement in networks to minimize access delays. PODC 2005: 87-96
- [c29]Shuchi Chawla, Anupam Gupta, Harald Räcke: Embeddings of negative-type metrics and an improved approximation to generalized sparsest cut. SODA 2005: 102-111
- [c28]Mihai Badoiu, Kedar Dhamdhere, Anupam Gupta, Yuri Rabinovich, Harald Räcke, R. Ravi, Anastasios Sidiropoulos: Approximation algorithms for low-distortion embeddings into low-dimensional spaces. SODA 2005: 119-128
- [c27]Hubert T.-H. Chan, Anupam Gupta, Bruce M. Maggs, Shuheng Zhou: On hierarchical routing in doubling metrics. SODA 2005: 762-771
- [c26]Julia Chuzhoy, Anupam Gupta, Joseph Naor, Amitabh Sinha: On the approximability of some network design problems. SODA 2005: 943-951
- 2004
- [j5]Anupam Gupta, Ilan Newman, Yuri Rabinovich, Alistair Sinclair: Cuts, Trees and l1-Embeddings of Graphs. Combinatorica 24(2): 233-269 (2004)
- [j4]Anupam Gupta, Amit Kumar, Rajeev Rastogi: Traveling with a Pez Dispenser (or, Routing Issues in MPLS). SIAM J. Comput. 34(2): 453-474 (2004)
- [c25]Anupam Gupta, Aravind Srinivasan, Éva Tardos: Cost-Sharing Mechanisms for Network Design. APPROX-RANDOM 2004: 139-150
- [c24]Anupam Gupta, R. Ravi, Amitabh Sinha: An Edge in Time Saves Nine: LP Rounding Approximation Algorithms for Stochastic Network Design. FOCS 2004: 218-227
- [c23]Kedar Dhamdhere, Anupam Gupta, R. Ravi: Approximation Algorithms for Minimizing Average Distortion. STACS 2004: 234-245
- [c22]Anupam Gupta, Martin Pál, R. Ravi, Amitabh Sinha: Boosted sampling: approximation algorithms for stochastic optimization. STOC 2004: 417-426
- 2003
- [j3]Sanjoy Dasgupta, Anupam Gupta: An elementary proof of a theorem of Johnson and Lindenstrauss. Random Struct. Algorithms 22(1): 60-65 (2003)
- [c21]Anupam Gupta, Robert Krauthgamer, James R. Lee: Bounded Geometries, Fractals, and Low-Distortion Embeddings. FOCS 2003: 534-543
- [c20]Anupam Gupta, Amit Kumar, Martin Pál, Tim Roughgarden: Approximation Via Cost-Sharing: A Simple Approximation Algorithm for the Multicommodity Rent-or-Buy Problem. FOCS 2003: 606-615
- [c19]
- [c18]Anupam Gupta, Amit Kumar, Rajeev Rastogi: Exploring the trade-off between label size and stack depth in MPLS Routing. INFOCOM 2003
- [c17]
- [c16]
- [c15]Alexandr Andoni, Michel Deza, Anupam Gupta, Piotr Indyk, Sofya Raskhodnikova: Lower bounds for embedding edit distance into normed spaces. SODA 2003: 523-526
- [c14]Chandra Chekuri, Anupam Gupta, Ilan Newman, Yuri Rabinovich, Alistair Sinclair: Embedding k-outerplanar graphs into l1. SODA 2003: 527-536
- [c13]
- [c12]Anupam Gupta, Amit Kumar, Tim Roughgarden: Simpler and better approximation algorithms for network design. STOC 2003: 365-372
- 2002
- [c11]Amit Chakrabarti, Chandra Chekuri, Anupam Gupta, Amit Kumar: Approximation Algorithms for the Unsplittable Flow Problem. APPROX 2002: 51-66
- [c10]Amit Kumar, Anupam Gupta, Tim Roughgarden: A Constant-Factor Approximation Algorithm for the Multicommodity. FOCS 2002: 333-
- [c9]Chandra Chekuri, Anupam Gupta, Amit Kumar, Joseph Naor, Danny Raz: Building Edge-Failure Resilient Networks. IPCO 2002: 439-456
- 2001
- [j2]Anupam Gupta: Improved Bandwidth Approximation for Trees and Chordal Graphs. J. Algorithms 40(1): 24-36 (2001)
- [c8]Anupam Gupta, Amit Kumar, Rajeev Rastogi: Traveling with a Pez Dispenser (Or, Routing Issues in MPLS). FOCS 2001: 148-157
- [c7]
- [c6]
- [c5]Anupam Gupta, Jon M. Kleinberg, Amit Kumar, Rajeev Rastogi, Bülent Yener: Provisioning a virtual private network: a network design problem for multicommodity flow. STOC 2001: 389-398
- 2000
- [j1]Anupam Gupta: Embedding Tree Metrics into Low-Dimensional Euclidean Spaces. Discrete & Computational Geometry 24(1): 105-116 (2000)
- [c4]
- [c3]Anupam Gupta, Éva Tardos: A constant factor approximation algorithm for a class of classification problems. STOC 2000: 652-658
1990 – 1999
- 1999
- [c2]Anupam Gupta, Ilan Newman, Yuri Rabinovich, Alistair Sinclair: Cuts, Trees and l1-Embeddings of Graphs. FOCS 1999: 399-409
- [c1]
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-06-11 09:52 CEST by the dblp team