The SCEAS System
| |||||||

## Search the dblp DataBase
Anupam Gupta:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
## Publications of Author- Amit Chakrabarti, Chandra Chekuri, Anupam Gupta, Amit Kumar
**Approximation Algorithms for the Unsplittable Flow Problem.**[Citation Graph (0, 0)][DBLP] APPROX, 2002, pp:51-66 [Conf] - Anupam Gupta, Amit Kumar
**Where's the Winner? Max-Finding and Sorting with Metric Costs.**[Citation Graph (0, 0)][DBLP] APPROX-RANDOM, 2005, pp:74-85 [Conf] - Anupam Gupta, Martin Pál, R. Ravi, Amitabh Sinha
**What About Wednesday? Approximation Algorithms for Multistage Stochastic Optimization.**[Citation Graph (0, 0)][DBLP] APPROX-RANDOM, 2005, pp:86-98 [Conf] - Anupam Gupta, Aravind Srinivasan, Éva Tardos
**Cost-Sharing Mechanisms for Network Design.**[Citation Graph (0, 0)][DBLP] APPROX-RANDOM, 2004, pp:139-150 [Conf] - Hubert T.-H. Chan, Michael Dinitz, Anupam Gupta
**Spanners with Slack.**[Citation Graph (0, 0)][DBLP] ESA, 2006, pp:196-207 [Conf] - Ittai Abraham, Yair Bartal, Hubert T.-H. Chan, Kedar Dhamdhere, Anupam Gupta, Jon M. Kleinberg, Ofer Neiman, Aleksandrs Slivkins
**Metric Embeddings with Relaxed Guarantees.**[Citation Graph (0, 0)][DBLP] FOCS, 2005, pp:83-100 [Conf] - Anupam Gupta, Amit Kumar
**Sorting and Selection with Structured Costs.**[Citation Graph (0, 0)][DBLP] FOCS, 2001, pp:416-425 [Conf] - Anupam Gupta, Robert Krauthgamer, James R. Lee
**Bounded Geometries, Fractals, and Low-Distortion Embeddings.**[Citation Graph (0, 0)][DBLP] FOCS, 2003, pp:534-543 [Conf] - Anupam Gupta, Amit Kumar, Martin Pál, Tim Roughgarden
**Approximation Via Cost-Sharing: A Simple Approximation Algorithm for the Multicommodity Rent-or-Buy Problem.**[Citation Graph (0, 0)][DBLP] FOCS, 2003, pp:606-0 [Conf] - Anupam Gupta, Amit Kumar, Rajeev Rastogi
**Traveling with a Pez Dispenser (Or, Routing Issues in MPLS).**[Citation Graph (0, 0)][DBLP] FOCS, 2001, pp:148-157 [Conf] - Anupam Gupta, Ilan Newman, Yuri Rabinovich, Alistair Sinclair
**Cuts, Trees and l**[Citation Graph (0, 0)][DBLP]_{1}-Embeddings of Graphs. FOCS, 1999, pp:399-409 [Conf] - Anupam Gupta, R. Ravi, Amitabh Sinha
**An Edge in Time Saves Nine: LP Rounding Approximation Algorithms for Stochastic Network Design.**[Citation Graph (0, 0)][DBLP] FOCS, 2004, pp:218-227 [Conf] - Amit Kumar, Anupam Gupta, Tim Roughgarden
**A Constant-Factor Approximation Algorithm for the Multicommodity.**[Citation Graph (0, 0)][DBLP] FOCS, 2002, pp:333-0 [Conf] - Anupam Gupta, Aravind Srinivasan
**On the Covering Steiner Problem.**[Citation Graph (0, 0)][DBLP] FSTTCS, 2003, pp:244-251 [Conf] - Anupam Gupta, Martin Pál
**Stochastic Steiner Trees Without a Root.**[Citation Graph (0, 0)][DBLP] ICALP, 2005, pp:1051-1063 [Conf] - Anupam Gupta, Amit Kumar, Rajeev Rastogi
**Exploring the trade-off between label size and stack depth in MPLS Routing.**[Citation Graph (0, 0)][DBLP] INFOCOM, 2003, pp:- [Conf] - Chandra Chekuri, Anupam Gupta, Amit Kumar, Joseph Naor, Danny Raz
**Building Edge-Failure Resilient Networks.**[Citation Graph (0, 0)][DBLP] IPCO, 2002, pp:439-456 [Conf] - Andreas Krause, Carlos Guestrin, Anupam Gupta, Jon M. Kleinberg
**Near-optimal sensor placements: maximizing information while minimizing communication cost.**[Citation Graph (0, 0)][DBLP] IPSN, 2006, pp:2-10 [Conf] - Daniel Golovin, Anupam Gupta, Bruce M. Maggs, Florian Oprea, Michael K. Reiter
**Quorum placement in networks: minimizing network congestion.**[Citation Graph (0, 0)][DBLP] PODC, 2006, pp:16-25 [Conf] - Anupam Gupta, Bruce M. Maggs, Florian Oprea, Michael K. Reiter
**Quorum placement in networks to minimize access delays.**[Citation Graph (0, 0)][DBLP] PODC, 2005, pp:87-96 [Conf] - Alexandr Andoni, Michel Deza, Anupam Gupta, Piotr Indyk, Sofya Raskhodnikova
**Lower bounds for embedding edit distance into normed spaces.**[Citation Graph (0, 0)][DBLP] SODA, 2003, pp:523-526 [Conf] - 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.**[Citation Graph (0, 0)][DBLP] SODA, 2005, pp:119-128 [Conf] - Hubert T.-H. Chan, Anupam Gupta
**Small hop-diameter sparse spanners for doubling metrics.**[Citation Graph (0, 0)][DBLP] SODA, 2006, pp:70-78 [Conf] - Hubert T.-H. Chan, Anupam Gupta, Bruce M. Maggs, Shuheng Zhou
**On hierarchical routing in doubling metrics.**[Citation Graph (0, 0)][DBLP] SODA, 2005, pp:762-771 [Conf] - Shuchi Chawla, Anupam Gupta, Harald Räcke
**Embeddings of negative-type metrics and an improved approximation to generalized sparsest cut.**[Citation Graph (0, 0)][DBLP] SODA, 2005, pp:102-111 [Conf] - Chandra Chekuri, Anupam Gupta, Ilan Newman, Yuri Rabinovich, Alistair Sinclair
**Embedding k-outerplanar graphs into l1.**[Citation Graph (0, 0)][DBLP] SODA, 2003, pp:527-536 [Conf] - Julia Chuzhoy, Anupam Gupta, Joseph Naor, Amitabh Sinha
**On the approximability of some network design problems.**[Citation Graph (0, 0)][DBLP] SODA, 2005, pp:943-951 [Conf] - Kedar Dhamdhere, Anupam Gupta, Harald Räcke
**Improved embeddings of graph metrics into random trees.**[Citation Graph (0, 0)][DBLP] SODA, 2006, pp:61-69 [Conf] - Anupam Gupta
**Improved bandwidth approximation for trees.**[Citation Graph (0, 0)][DBLP] SODA, 2000, pp:788-793 [Conf] - Anupam Gupta
**Steiner points in tree metrics don't (really) help.**[Citation Graph (0, 0)][DBLP] SODA, 2001, pp:220-227 [Conf] - Anupam Gupta
**Improved results for directed multicut.**[Citation Graph (0, 0)][DBLP] SODA, 2003, pp:454-455 [Conf] - Anupam Gupta, Mohammad Taghi Hajiaghayi, Harald Räcke
**Oblivious network design.**[Citation Graph (0, 0)][DBLP] SODA, 2006, pp:970-979 [Conf] - Anupam Gupta, Kunal Talwar
**Approximating unique games.**[Citation Graph (0, 0)][DBLP] SODA, 2006, pp:99-106 [Conf] - Anupam Gupta, Francis Zane
**Counting inversions in lists.**[Citation Graph (0, 0)][DBLP] SODA, 2003, pp:253-254 [Conf] - Anupam Gupta, Amit Kumar, Mikkel Thorup
**Tree based MPLS routing.**[Citation Graph (0, 0)][DBLP] SPAA, 2003, pp:193-199 [Conf] - Kedar Dhamdhere, Anupam Gupta, R. Ravi
**Approximation Algorithms for Minimizing Average Distortion.**[Citation Graph (0, 0)][DBLP] STACS, 2004, pp:234-245 [Conf] - Anupam Gupta
**Embedding Tree Metrics Into Low Dimensional Euclidean Spaces.**[Citation Graph (0, 0)][DBLP] STOC, 1999, pp:694-700 [Conf] - Anupam Gupta, Jon M. Kleinberg, Amit Kumar, Rajeev Rastogi, Bülent Yener
**Provisioning a virtual private network: a network design problem for multicommodity flow.**[Citation Graph (0, 0)][DBLP] STOC, 2001, pp:389-398 [Conf] - Anupam Gupta, Amit Kumar, Tim Roughgarden
**Simpler and better approximation algorithms for network design.**[Citation Graph (0, 0)][DBLP] STOC, 2003, pp:365-372 [Conf] - Anupam Gupta, Martin Pál, R. Ravi, Amitabh Sinha
**Boosted sampling: approximation algorithms for stochastic optimization.**[Citation Graph (0, 0)][DBLP] STOC, 2004, pp:417-426 [Conf] - Anupam Gupta, Éva Tardos
**A constant factor approximation algorithm for a class of classification problems.**[Citation Graph (0, 0)][DBLP] STOC, 2000, pp:652-658 [Conf] - Chandra Chekuri, Anupam Gupta, Amit Kumar, Joseph Naor, Danny Raz
**Building Edge-Failure Resilient Networks.**[Citation Graph (0, 0)][DBLP] Algorithmica, 2005, v:43, n:1-2, pp:17-41 [Journal] - Anupam Gupta, Ilan Newman, Yuri Rabinovich, Alistair Sinclair
**Cuts, Trees and l**[Citation Graph (0, 0)][DBLP]_{1}-Embeddings of Graphs. Combinatorica, 2004, v:24, n:2, pp:233-269 [Journal] - Chandra Chekuri, Anupam Gupta, Amit Kumar
**On a bidirected relaxation for the MULTIWAY CUT problem.**[Citation Graph (0, 0)][DBLP] Discrete Applied Mathematics, 2005, v:150, n:1-3, pp:67-79 [Journal] - Anupam Gupta
**Embedding Tree Metrics into Low-Dimensional Euclidean Spaces.**[Citation Graph (0, 0)][DBLP] Discrete & Computational Geometry, 2000, v:24, n:1, pp:105-116 [Journal] - Anupam Gupta
**Improved Bandwidth Approximation for Trees and Chordal Graphs.**[Citation Graph (0, 0)][DBLP] J. Algorithms, 2001, v:40, n:1, pp:24-36 [Journal] - Kedar Dhamdhere, Anupam Gupta, R. Ravi
**Approximation Algorithms for Minimizing Average Distortion.**[Citation Graph (0, 0)][DBLP] Theory Comput. Syst., 2006, v:39, n:1, pp:93-111 [Journal] - Sanjoy Dasgupta, Anupam Gupta
**An elementary proof of a theorem of Johnson and Lindenstrauss.**[Citation Graph (0, 0)][DBLP] Random Struct. Algorithms, 2003, v:22, n:1, pp:60-65 [Journal] - Anupam Gupta, Amit Kumar, Rajeev Rastogi
**Traveling with a Pez Dispenser (or, Routing Issues in MPLS).**[Citation Graph (0, 0)][DBLP] SIAM J. Comput., 2004, v:34, n:2, pp:453-474 [Journal] - Chandra Chekuri, Anupam Gupta, Ilan Newman, Yuri Rabinovich, Alistair Sinclair
**Embedding**[Citation Graph (0, 0)][DBLP]*k*-Outerplanar Graphs into*l*_{1}. SIAM J. Discrete Math., 2006, v:20, n:1, pp:119-136 [Journal] - Anupam Gupta, MohammadTaghi Hajiaghayi, Amit Kumar
**Stochastic Steiner Tree with Non-uniform Inflation.**[Citation Graph (0, 0)][DBLP] APPROX-RANDOM, 2007, pp:134-148 [Conf] - Vineet Goyal, Anupam Gupta, Stefano Leonardi, R. Ravi
**Pricing Tree Access Networks with Connected Backbones.**[Citation Graph (0, 0)][DBLP] ESA, 2007, pp:498-509 [Conf] - Anupam Gupta, MohammadTaghi Hajiaghayi, Viswanath Nagarajan, R. Ravi
**Dial a Ride from**[Citation Graph (0, 0)][DBLP]*k*-Forest. ESA, 2007, pp:241-252 [Conf] - Nikhil Bansal, Niv Buchbinder, Anupam Gupta, Joseph Naor
**An**[Citation Graph (0, 0)][DBLP]*O*(log^{2}*k*)-Competitive Algorithm for Metric Bipartite Matching. ESA, 2007, pp:522-533 [Conf] - Barbara M. Anthony, Anupam Gupta
**Infrastructure Leasing Problems.**[Citation Graph (0, 0)][DBLP] IPCO, 2007, pp:424-438 [Conf] - Anupam Gupta, Jochen Könemann, Stefano Leonardi, R. Ravi, Guido Schäfer
**An efficient cost-sharing mechanism for the prize-collecting Steiner forest problem.**[Citation Graph (0, 0)][DBLP] SODA, 2007, pp:1153-1162 [Conf] - Amit Chakrabarti, Chandra Chekuri, Anupam Gupta, Amit Kumar
**Approximation Algorithms for the Unsplittable Flow Problem.**[Citation Graph (0, 0)][DBLP] Algorithmica, 2007, v:47, n:1, pp:53-78 [Journal] - Anupam Gupta, MohammadTaghi Hajiaghayi, Viswanath Nagarajan, R. Ravi
**Dial a Ride from k-forest**[Citation Graph (0, 0)][DBLP] CoRR, 2007, v:0, n:, pp:- [Journal] - Anupam Gupta, Amit Kumar, Martin Pál, Tim Roughgarden
**Approximation via cost sharing: Simpler and better approximation algorithms for network design.**[Citation Graph (0, 0)][DBLP] J. ACM, 2007, v:54, n:3, pp:11- [Journal] **Scheduling with Outliers.**[Citation Graph (, )][DBLP]**Vertex Sparsifiers: New Results from Old Techniques.**[Citation Graph (, )][DBLP]**On Configuring BGP Route Reflectors.**[Citation Graph (, )][DBLP]**When LP Is the Cure for Your Matching Woes: Improved Bounds for Stochastic Matchings - (Extended Abstract).**[Citation Graph (, )][DBLP]**Set Covering with our Eyes Closed.**[Citation Graph (, )][DBLP]**All-Norms and All-L_p-Norms Approximation Algorithms.**[Citation Graph (, )][DBLP]**Scalably Scheduling Power-Heterogeneous Processors.**[Citation Graph (, )][DBLP]**Thresholded Covering Algorithms for Robust and Max-min Optimization.**[Citation Graph (, )][DBLP]**Approximation Algorithms for Optimal Decision Trees and Adaptive TSP Problems.**[Citation Graph (, )][DBLP]**Simultaneous placement and scheduling of sensors.**[Citation Graph (, )][DBLP]**How to Complete a Doubling Metric.**[Citation Graph (, )][DBLP]**Selecting Observations against Adversarial Objectives.**[Citation Graph (, )][DBLP]**Approximating TSP on metrics with bounded global growth.**[Citation Graph (, )][DBLP]**Stochastic analyses for online combinatorial optimization problems.**[Citation Graph (, )][DBLP]**Set connectivity problems in undirected graphs and the directed Steiner network problem.**[Citation Graph (, )][DBLP]**A plant location guide for the unsure.**[Citation Graph (, )][DBLP]**Ultra-low-dimensional embeddings for doubling metrics.**[Citation Graph (, )][DBLP]**Approximate clustering without the approximation.**[Citation Graph (, )][DBLP]**Secretary problems: weights and discounts.**[Citation Graph (, )][DBLP]**A Constant Factor Approximation Algorithm for Generalized Min-Sum Set Cover.**[Citation Graph (, )][DBLP]**Differentially Private Combinatorial Optimization.**[Citation Graph (, )][DBLP]**Tree Embeddings for Two-Edge-Connected Network Design.**[Citation Graph (, )][DBLP]**Scheduling jobs with varying parallelizability to reduce variance.**[Citation Graph (, )][DBLP]**A constant-factor approximation for stochastic Steiner forest.**[Citation Graph (, )][DBLP]**Online and stochastic survivable network design.**[Citation Graph (, )][DBLP]**Cost-Sharing Mechanisms for Network Design.**[Citation Graph (, )][DBLP]**How to Complete a Doubling Metric**[Citation Graph (, )][DBLP]**Simpler Analyses of Local Search Algorithms for Facility Location**[Citation Graph (, )][DBLP]**Differentially Private Approximation Algorithms**[Citation Graph (, )][DBLP]**Scheduling with Outliers**[Citation Graph (, )][DBLP]**Thresholded Covering Algorithms for Robust and Max-Min Optimization**[Citation Graph (, )][DBLP]**When LP is the Cure for Your Matching Woes: Approximating Stochastic Matchings**[Citation Graph (, )][DBLP]**Approximation Algorithms for Optimal Decision Trees and Adaptive TSP Problems**[Citation Graph (, )][DBLP]**Constrained Non-Monotone Submodular Maximization: Offline and Secretary Algorithms**[Citation Graph (, )][DBLP]**Vertex Sparsifiers: New Results from Old Techniques**[Citation Graph (, )][DBLP]**When LP is the Cure for Your Matching Woes: Improved Bounds for Stochastic Matchings**[Citation Graph (, )][DBLP]**Small Hop-diameter Sparse Spanners for Doubling Metrics.**[Citation Graph (, )][DBLP]
Search in 0.062secs, Finished in 0.066secs | |||||||

| |||||||

| |||||||

System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002 for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002 |