| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | 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  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Anupam Gupta, Ravishankar Krishnaswamy, Viswanath Nagarajan, R. Ravi |
Approximation algorithms for stochastic orienteering. |
SODA |
2012 |
DBLP BibTeX RDF |
|
| 1 | Anupam Gupta, Sungjin Im, Ravishankar Krishnaswamy, Benjamin Moseley, Kirk Pruhs |
Scheduling heterogeneous processors isn't as easy as you think. |
SODA |
2012 |
DBLP BibTeX RDF |
|
| 1 | Anupam Gupta, Aaron Roth, Jonathan Ullman |
Iterative Constructions and Private Data Release. |
TCC |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Anupam Gupta, Kunal Talwar |
Making Doubling Metrics Geodesic. |
Algorithmica |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Han Liu, Min Xu, Haijie Gu, Anupam Gupta, John D. Lafferty, Larry A. Wasserman |
Forest Density Estimation. |
Journal of Machine Learning Research |
2011 |
DBLP BibTeX RDF |
|
| 1 | Andreas Krause, Ram Rajagopal, Anupam Gupta, Carlos Guestrin |
Simultaneous Optimization of Sensor Placements and Balanced Schedules. |
IEEE Trans. Automat. Contr. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Chandra Chekuri, Guy Even, Anupam Gupta, Danny Segev |
Set connectivity problems in undirected graphs and the directed steiner network problem. |
ACM Transactions on Algorithms |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Andreas Krause, Carlos Guestrin, Anupam Gupta, Jon M. Kleinberg |
Robust sensor placements at informative and communication-efficient locations. |
TOSN |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Anupam Gupta, Ravishankar Krishnaswamy, Kirk Pruhs |
Scalably Scheduling Power-Heterogeneous Processors |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | Anupam Gupta, Ravishankar Krishnaswamy, Marco Molinaro, R. Ravi |
Approximation Algorithms for Correlated Knapsacks and Non-Martingale Bandits |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | Anupam Gupta, Aaron Roth, Jonathan Ullman |
Iterative Constructions and Private Data Release |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | Avrim Blum, Anupam Gupta, Yishay Mansour, Ankit Sharma |
Welfare and Profit Maximization with Production Costs |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | Anupam Gupta, Ravishankar Krishnaswamy, Kirk Pruhs |
Online Primal-Dual For Non-linear Optimization with Applications to Speed Scaling |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | 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 |
2011 |
DBLP BibTeX RDF |
|
| 1 | Anupam Gupta, Martin Pál, R. Ravi, Amitabh Sinha |
Sampling and Cost-Sharing: Approximation Algorithms for Stochastic Optimization Problems. |
SIAM J. Comput. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
DBLP DOI BibTeX RDF |
|
| 1 | Anupam Gupta, Ravishankar Krishnaswamy, Marco Molinaro, R. Ravi |
Approximation Algorithms for Correlated Knapsacks and Non-martingale Bandits. |
FOCS |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Avrim Blum, Anupam Gupta, Yishay Mansour, Ankit Sharma |
Welfare and Profit Maximization with Production Costs. |
FOCS |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Anupam Gupta, Moritz Hardt, Aaron Roth, Jonathan Ullman |
Privately releasing conjunctions and the statistical query barrier. |
STOC |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Anupam Gupta, Viswanath Nagarajan, R. Ravi |
An improved approximation algorithm for requirement cut. |
Oper. Res. Lett. |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Anupam Gupta, Mohammad Taghi Hajiaghayi, Viswanath Nagarajan, R. Ravi |
Dial a Ride from k-forest. |
ACM Transactions on Algorithms |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | T.-H. Hubert Chan, Anupam Gupta, Kunal Talwar |
Ultra-low-dimensional embeddings for doubling metrics. |
J. ACM |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | 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. |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
2010 |
DBLP BibTeX RDF |
|
| 1 | Anupam Gupta, Moritz Hardt, Aaron Roth, Jonathan Ullman |
Privately Releasing Conjunctions and the Statistical Query Barrier |
CoRR |
2010 |
DBLP BibTeX RDF |
|
| 1 | Matthias Englert, Anupam Gupta, Robert Krauthgamer, Harald Räcke, Inbal Talgam-Cohen, Kunal Talwar |
Vertex Sparsifiers: New Results from Old Techniques |
CoRR |
2010 |
DBLP BibTeX RDF |
|
| 1 | Anupam Gupta, Aaron Roth, Grant Schoenebeck, Kunal Talwar |
Constrained Non-Monotone Submodular Maximization: Offline and Secretary Algorithms |
CoRR |
2010 |
DBLP BibTeX RDF |
|
| 1 | Anupam Gupta, Ravishankar Krishnaswamy, Viswanath Nagarajan, R. Ravi |
Approximation Algorithms for Optimal Decision Trees and Adaptive TSP Problems |
CoRR |
2010 |
DBLP BibTeX RDF |
|
| 1 | Nikhil Bansal, Anupam Gupta, Viswanath Nagarajan, Atri Rudra |
When LP is the Cure for Your Matching Woes: Approximating Stochastic Matchings |
CoRR |
2010 |
DBLP BibTeX RDF |
|
| 1 | Anupam Gupta, Viswanath Nagarajan, R. Ravi |
Robust and MaxMin Optimization under Matroid and Knapsack Uncertainty Sets |
CoRR |
2010 |
DBLP BibTeX RDF |
|
| 1 | 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 |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Nikhil Bansal, Anupam Gupta, Ravishankar Krishnaswamy |
A Constant Factor Approximation Algorithm for Generalized Min-Sum Set Cover. |
SODA |
2010 |
DBLP BibTeX RDF |
|
| 1 | Anupam Gupta, Katrina Ligett, Frank McSherry, Aaron Roth, Kunal Talwar |
Differentially Private Combinatorial Optimization. |
SODA |
2010 |
DBLP BibTeX RDF |
|
| 1 | Anupam Gupta, Ravishankar Krishnaswamy, R. Ravi |
Tree Embeddings for Two-Edge-Connected Network Design. |
SODA |
2010 |
DBLP BibTeX RDF |
|
| 1 | Anupam Gupta, Aaron Roth, Grant Schoenebeck, Kunal Talwar |
Constrained Non-monotone Submodular Maximization: Offline and Secretary Algorithms. |
WINE |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Anupam Gupta, Viswanath Nagarajan, R. Ravi |
Approximation Algorithms for Optimal Decision Trees and Adaptive TSP Problems. |
ICALP |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Anupam Gupta, Ravishankar Krishnaswamy, Kirk Pruhs |
Scalably Scheduling Power-Heterogeneous Processors. |
ICALP |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Anupam Gupta, Viswanath Nagarajan, R. Ravi |
Thresholded Covering Algorithms for Robust and Max-min Optimization. |
ICALP |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Vyas Sekar, Anupam Gupta, Mike K. Reiter, Hui Zhang |
Coordinated sampling sans Origin-Destination identifiers: Algorithms and analysis. |
COMSNETS |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Anupam Gupta, Ravishankar Krishnaswamy, Kirk Pruhs |
Nonclairvoyantly scheduling power-heterogeneous processors. |
Green Computing Conference |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Anupam Gupta, Sungjin Im, Ravishankar Krishnaswamy, Benjamin Moseley, Kirk Pruhs |
Scheduling jobs with varying parallelizability to reduce variance. |
SPAA |
2010 |
DBLP DOI BibTeX RDF |
online algorithms, scheduling algorithms |
| 1 | Vyas Sekar, Ravishankar Krishnaswamy, Anupam Gupta, Michael K. Reiter |
Network-wide deployment of intrusion detection and prevention systems. |
CoNEXT |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Matthias Englert, Anupam Gupta, Robert Krauthgamer, Harald Räcke, Inbal Talgam-Cohen, Kunal Talwar |
Vertex Sparsifiers: New Results from Old Techniques. |
APPROX-RANDOM |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Anupam Gupta, John D. Lafferty, Han Liu, Larry A. Wasserman, Min Xu |
Forest Density Estimation. |
COLT |
2010 |
DBLP BibTeX RDF |
|
| 1 | T.-H. Hubert Chan, Anupam Gupta |
Small Hop-diameter Sparse Spanners for Doubling Metrics. |
Discrete & Computational Geometry |
2009 |
DBLP DOI BibTeX RDF |
Hop diameter, Algorithms, Doubling metrics, Sparse spanners |
| 1 | Anupam Gupta, Katrina Ligett, Frank McSherry, Aaron Roth, Kunal Talwar |
Differentially Private Approximation Algorithms |
CoRR |
2009 |
DBLP BibTeX RDF |
|
| 1 | Anupam Gupta, Viswanath Nagarajan, R. Ravi |
Thresholded Covering Algorithms for Robust and Max-Min Optimization |
CoRR |
2009 |
DBLP BibTeX RDF |
|
| 1 | Anupam Gupta, Ravishankar Krishnaswamy, Amit Kumar, Danny Segev |
Scheduling with Outliers |
CoRR |
2009 |
DBLP BibTeX RDF |
|
| 1 | T.-H. Hubert Chan, Kedar Dhamdhere, Anupam Gupta, Jon M. Kleinberg, Aleksandrs Slivkins |
Metric Embeddings with Relaxed Guarantees. |
SIAM J. Comput. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Moshe Babaioff, Michael Dinitz, Anupam Gupta, Nicole Immorlica, Kunal Talwar |
Secretary problems: weights and discounts. |
SODA |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Maria-Florina Balcan, Avrim Blum, Anupam Gupta |
Approximate clustering without the approximation. |
SODA |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Andreas Krause, Ram Rajagopal, Anupam Gupta, Carlos Guestrin |
Simultaneous placement and scheduling of sensors. |
IPSN |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Anupam Gupta, Ravishankar Krishnaswamy, Amit Kumar, Danny Segev |
Scheduling with Outliers. |
APPROX-RANDOM |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Anupam Gupta, Ravishankar Krishnaswamy, R. Ravi |
Online and stochastic survivable network design. |
STOC |
2009 |
DBLP DOI BibTeX RDF |
approximation algorithms, online algorithms, network design problems |
| 1 | Anupam Gupta, Amit Kumar |
A constant-factor approximation for stochastic Steiner forest. |
STOC |
2009 |
DBLP DOI BibTeX RDF |
approximation algorithms, stochastic algorithms |
| 1 | Anupam Gupta, Aravind Srinivasan, Éva Tardos |
Cost-Sharing Mechanisms for Network Design. |
Algorithmica |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Julia Chuzhoy, Anupam Gupta, Joseph Naor, Amitabh Sinha |
On the approximability of some network design problems. |
ACM Transactions on Algorithms |
2008 |
DBLP DOI BibTeX RDF |
cost-distance, fixed charge network flow, priority Steiner tree, network design, Hardness of approximation |
| 1 | Shuchi Chawla, Anupam Gupta, Harald Räcke |
Embeddings of negative-type metrics and an improved approximation to generalized sparsest cut. |
ACM Transactions on Algorithms |
2008 |
DBLP DOI BibTeX RDF |
negative-type metric, Approximation algorithm, metrics, embedding, sparsest cut |
| 1 | Anupam Gupta, Kanat Tangwongsan |
Simpler Analyses of Local Search Algorithms for Facility Location |
CoRR |
2008 |
DBLP BibTeX RDF |
|
| 1 | Anupam Gupta, Ziv Bar-Joseph |
Extracting Dynamics from Static Cancer Expression Data. |
IEEE/ACM Trans. Comput. Biology Bioinform. |
2008 |
DBLP DOI BibTeX RDF |
glioma, microarrays, EM, traveling salesman |
| 1 | T.-H. Hubert Chan, Anupam Gupta |
Approximating TSP on metrics with bounded global growth. |
SODA |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Chandra Chekuri, Guy Even, Anupam Gupta, Danny Segev |
Set connectivity problems in undirected graphs and the directed Steiner network problem. |
SODA |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Barbara M. Anthony, Vineet Goyal, Anupam Gupta, Viswanath Nagarajan |
A plant location guide for the unsure. |
SODA |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Naveen Garg, Anupam Gupta, Stefano Leonardi, Piotr Sankowski |
Stochastic analyses for online combinatorial optimization problems. |
SODA |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | T.-H. Hubert Chan, Anupam Gupta, Kunal Talwar |
Ultra-low-dimensional embeddings for doubling metrics. |
SODA |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Anupam Gupta, Kunal Talwar |
How to Complete a Doubling Metric. |
LATIN |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Fabrizio Grandoni, Anupam Gupta, Stefano Leonardi, Pauli Miettinen, Piotr Sankowski, Mohit Singh |
Set Covering with our Eyes Closed. |
FOCS |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Daniel Golovin, Anupam Gupta, Amit Kumar, Kanat Tangwongsan |
All-Norms and All-L_p-Norms Approximation Algorithms. |
FSTTCS |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Amit Chakrabarti, Chandra Chekuri, Anupam Gupta, Amit Kumar |
Approximation Algorithms for the Unsplittable Flow Problem. |
Algorithmica |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Anupam Gupta, Amit Kumar, Martin Pál, Tim Roughgarden |
Approximation via cost sharing: Simpler and better approximation algorithms for network design. |
J. ACM |
2007 |
DBLP DOI BibTeX RDF |
Approximation algorithms, network design, random sampling, cost sharing |
| 1 | Anupam Gupta, R. Ravi, Amitabh Sinha |
LP Rounding Approximation Algorithms for Stochastic Network Design. |
Math. Oper. Res. |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Anupam Gupta, MohammadTaghi Hajiaghayi, Viswanath Nagarajan, R. Ravi |
Dial a Ride from k-forest |
CoRR |
2007 |
DBLP BibTeX RDF |
|
| 1 | Anupam Gupta, Kunal Talwar |
How to Complete a Doubling Metric |
CoRR |
2007 |
DBLP BibTeX RDF |
|
| 1 | Vineet Goyal, Anupam Gupta, Stefano Leonardi, R. Ravi |
Pricing Tree Access Networks with Connected Backbones. |
ESA |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Nikhil Bansal, Niv Buchbinder, Anupam Gupta, Joseph Naor |
An O (log2 k )-Competitive Algorithm for Metric Bipartite Matching. |
ESA |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Anupam Gupta, MohammadTaghi Hajiaghayi, Viswanath Nagarajan, R. Ravi |
Dial a Ride from k -Forest. |
ESA |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
DBLP DOI BibTeX RDF |
|
| 1 | Barbara M. Anthony, Anupam Gupta |
Infrastructure Leasing Problems. |
IPCO |
2007 |
DBLP DOI BibTeX RDF |
stochastic combinatorial optimization, Approximation algorithms, randomized algorithms, graph and network algorithms |
| 1 | Anupam Gupta, MohammadTaghi Hajiaghayi, Amit Kumar |
Stochastic Steiner Tree with Non-uniform Inflation. |
APPROX-RANDOM |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Andreas Krause, H. Brendan McMahan, Carlos Guestrin, Anupam Gupta |
Selecting Observations against Adversarial Objectives. |
NIPS |
2007 |
DBLP BibTeX RDF |
|
| 1 | Yuri Breitbart, Minos N. Garofalakis, Anupam Gupta, Amit Kumar, Rajeev Rastogi |
On Configuring BGP Route Reflectors. |
COMSWARE |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Anupam Gupta, Aravind Srinivasan |
An Improved Approximation Ratio for the Covering Steiner Problem. |
Theory of Computing |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Chandra Chekuri, Anupam Gupta, Ilan Newman, Yuri Rabinovich, Alistair Sinclair |
Embedding k-Outerplanar Graphs into l 1. |
SIAM J. Discrete Math. |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Kedar Dhamdhere, Anupam Gupta, R. Ravi |
Approximation Algorithms for Minimizing Average Distortion. |
Theory Comput. Syst. |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Hubert T.-H. Chan, Michael Dinitz, Anupam Gupta |
Spanners with Slack. |
ESA |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Anupam Gupta, Mohammad Taghi Hajiaghayi, Harald Räcke |
Oblivious network design. |
SODA |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Kedar Dhamdhere, Anupam Gupta, Harald Räcke |
Improved embeddings of graph metrics into random trees. |
SODA |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Anupam Gupta, Kunal Talwar |
Approximating unique games. |
SODA |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Hubert T.-H. Chan, Anupam Gupta |
Small hop-diameter sparse spanners for doubling metrics. |
SODA |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Andreas Krause, Carlos Guestrin, Anupam Gupta, Jon M. Kleinberg |
Near-optimal sensor placements: maximizing information while minimizing communication cost. |
IPSN |
2006 |
DBLP DOI BibTeX RDF |
spatial monitoring, sensor networks, approximation algorithms, theory, information, communication cost, gaussian processes, sensor placement, link quality |
| 1 | Daniel Golovin, Anupam Gupta, Bruce M. Maggs, Florian Oprea, Michael K. Reiter |
Quorum placement in networks: minimizing network congestion. |
PODC |
2006 |
DBLP DOI BibTeX RDF |
congestion problems, approximation algorithms, Quorum systems, LP rounding |
| 1 | Chandra Chekuri, Anupam Gupta, Amit Kumar, Joseph Naor, Danny Raz |
Building Edge-Failure Resilient Networks. |
Algorithmica |
2005 |
DBLP DOI BibTeX RDF |
Backup path, Approximation algorithm, Network design, Restoration, Link failure |
| 1 | Chandra Chekuri, Anupam Gupta, Amit Kumar |
On a bidirected relaxation for the MULTIWAY CUT problem. |
Discrete Applied Mathematics |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Shuchi Chawla, Anupam Gupta, Harald Räcke |
Embeddings of negative-type metrics and an improved approximation to generalized sparsest cut. |
SODA |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Hubert T.-H. Chan, Anupam Gupta, Bruce M. Maggs, Shuheng Zhou |
On hierarchical routing in doubling metrics. |
SODA |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Julia Chuzhoy, Anupam Gupta, Joseph Naor, Amitabh Sinha |
On the approximability of some network design problems. |
SODA |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
DBLP DOI BibTeX RDF |
|
| 1 | Anupam Gupta, Martin Pál |
Stochastic Steiner Trees Without a Root. |
ICALP |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Anupam Gupta, Bruce M. Maggs, Florian Oprea, Michael K. Reiter |
Quorum placement in networks to minimize access delays. |
PODC |
2005 |
DBLP DOI BibTeX RDF |
approximation algorithms, location, quorum systems, problems, LP rounding |
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")