Conference Scheduling Heterogeneous Processors Isn't As Easy As You Think 2012 1242-1253 Gupta A, Im S, Krishnaswamy R, Moseley B, Pruhs K
Journal Article Technical Note---Approximation Algorithms for VRP with Stochastic Demands 2012 123-127 Gupta A, Nagarajan V, Ravi R
Conference The Online Metric Matching Problem for Doubling Metrics 2012 • Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) • 7391:424-435 Gupta A, Lewi K
Journal Article When LP Is the Cure for Your Matching Woes: Improved Bounds for Stochastic Matchings 2012 • Algorithmica • 63(4):733-762 Bansal N, Gupta A, Li J, Mestre J, Nagarajan V, Rudra A
Preprint Approximation Algorithms for Correlated Knapsacks and Non-Martingale Bandits 2011 Gupta A, Krishnaswamy R, Molinaro M, Ravi R
Conference Approximation Algorithms for Correlated Knapsacks and Non-Martingale Bandits 2011 • Annual Symposium on Foundations of Computer Science • 827-836 Gupta A, Krishnaswamy R, Molinaro M, Ravi R
Book Approximation algorithms for network design: A survey 2011 • Surveys in Operations Research and Management Science • 16(1):3-20 Gupta A, Könemann J
Journal Article Discovering pathways by orienting edges in protein interaction networks 2011 • Nucleic Acids Research (NAR) • 39(4): Gitter A, Klein-Seetharaman J, Gupta A, Bar-Joseph Z
Journal Article Forest Density Estimation 2011 • Journal of machine learning research • 12:907-951 Liu H, Xu M, Gu H, Gupta A, Lafferty J, Wasserman L
Journal Article Near Linear-Work Parallel SDD Solvers, Low-Diameter Decomposition, and Low-Stretch Subgraphs 2011 • SPAA 11: PROCEEDINGS OF THE TWENTY-THIRD ANNUAL SYMPOSIUM ON PARALLELISM IN ALGORITHMS AND ARCHITECTURES • 13-22 Blelloch GE, Gupta A, Koutis I, Miller GL, Peng R, Tangwongsan K
Preprint Near Linear-Work Parallel SDD Solvers, Low-Diameter Decomposition, and Low-Stretch Subgraphs 2011 Blelloch GE, Gupta A, Koutis I, Miller GL, Peng R, Tangwongsan K
Conference Nonclairvoyantly scheduling power-heterogeneous processors 2011 • Sustainable Computing: Informatics and Systems • 1(3):248-255 Gupta A, Krishnaswamy R, Pruhs K
Preprint Online Primal-Dual For Non-linear Optimization with Applications to Speed Scaling 2011 Gupta A, Krishnaswamy R, Pruhs K
Conference Privately Releasing Conjunctions and the Statistical Query Barrier 2011 • Annual ACM Symposium on Theory of Computing • 803-812 Gupta A, Hardt M, Roth A, Ullman J
Journal Article Robust Sensor Placements at Informative and Communication-Efficient Locations 2011 • ACM transactions on sensor networks • 7(4): Krause A, Guestrin C, Gupta A, Kleinberg J
Journal Article SAMPLING AND COST-SHARING: APPROXIMATION ALGORITHMS FOR STOCHASTIC OPTIMIZATION PROBLEMS 2011 • SIAM journal on computing (Print) • 40(5):1361-1401 Gupta A, Pal M, Ravi R, Sinha A
Journal Article Set connectivity problems in undirected graphs and the directed steiner network problem 2011 • ACM Transactions on Algorithms (TALG) • 7(2):1-17 Chekuri C, Even G, Gupta A, Segev D
Journal Article Simultaneous Optimization of Sensor Placements and Balanced Schedules 2011 • IEEE Transactions on Automatic Control • 56(10):2390-2405 Krause A, Rajagopal R, Gupta A, Guestrin C
Preprint Welfare and Profit Maximization with Production Costs 2011 Blum A, Gupta A, Mansour Y, Sharma A
Conference Welfare and Profit Maximization with Production Costs 2011 • Annual Symposium on Foundations of Computer Science • 77-86 Blum A, Gupta A, Mansour Y, Sharma A
Conference A Constant Factor Approximation Algorithm for Generalized Min-Sum Set Cover 2010 • PROCEEDINGS OF THE TWENTY-FIRST ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS • 135:1539-+ Bansal N, Gupta A, Krishnaswamy R
Journal Article A Plant Location Guide for the Unsure: Approximation Algorithms for Min-Max Location Problems 2010 • Mathematics of Operations Research • 35(1):79-101 Anthony B, Goyal V, Gupta A, Nagarajan V
Journal Article An improved approximation algorithm for requirement cut 2010 • Operations Research Letters • 38(4):322-325 Gupta A, Nagarajan V, Ravi R
