Anupam Gupta, Martin Pal, R. Ravi, Amitabh Sinha  Home/Search
Context Related
| cornell.edu/People/mp...boost_STOC04.ps From: cornell.edu/People/mpal/papers... (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: Several combinatorial optimization problems choose elements to minimize the total cost of constructing a feasible solution that satisfies requirements of clients. In the STEINER TREE problem, for example, edges must be chosen to connect terminals (clients); in VERTEX COVER, vertices must be chosen to cover edges (clients); in FACILITY LOCATION, facilities must be chosen and demand vertices (clients) connected to these chosen facilities. (Update)
Similar documents based on text: More All
0.7: Boosted Sampling: Approximation Algorithms for Stochastic.. - Pal, Ravi, Sinha (2003) (Correct)
0.1: On the Integrality Gap of a Natural Formulation of .. - Garg, Khandekar.. (2000) (Correct)
0.1: Algorithms for Flow Time Scheduling - Bansal (2003) (Correct)
BibTeX entry: (Update)
A. Gupta, M. Pal, R. Ravi and A. Sinha, Boosted sampling: Approximation algorithms for stochastic optimization, Proceedings of the 36th Annual ACM Symposium on Theory of Computing (STOC), 2004. http://citeseer.ist.psu.edu/article/gupta04boosted.html More
@misc{ gupta04boosted,
author = "A. Gupta and M. Pal and R. Ravi and A. Sinha",
title = "Boosted sampling: Approximation algorithms for stochastic optimization",
text = "A. Gupta, M. Pal, R. Ravi and A. Sinha, Boosted sampling: Approximation
algorithms for stochastic optimization, Proceedings of the 36th Annual ACM
Symposium on Theory of Computing (STOC), 2004.",
year = "2004",
url = "citeseer.ist.psu.edu/article/gupta04boosted.html" }
Citations (may not include all citations):160 Simpler and better approximation algorithms for network desi.. - Gupta, Kumar et al. - 2003
98 Introduction to stochastic programming (context) - Birge, Louveaux - 1997
71 Scheduling: Theory (context) - Pinedo - 1995
49 Improved Steiner tree approximation in graphs - Robins, Zelikovsky - 2000
39 Strategyproof sharing of submodular costs: budget balance ve.. - Moulin, Shenker - 2001
37 Applications of approximation algorithms to cooperative game.. - Jain, Vazirani - 2001
29 Linear programming under uncertainty (context) - Dantzig - 1955
26 Building Steiner trees with incomplete global knowledge (context) - Karger, Minkoff - 2000
24 The online median problem - Mettu, Plaxton - 2000
17 On minimizing a convex function subject to linear inequaliti.. (context) - Beale - 1955
11 Group strategyproof mechanisms via primal-dual algorithms - Pal, Tardos - 2003
11 Equitable cost allocations via primal-dual-type algorithms - Jain, Vazirani - 2002
8 Stochastic load balancing and related problems - Goel, Indyk - 1999
7 Two-stage stochastic integer programming: a survey - Schultz, Stougie et al. - 1996
6 Cost allocation (context) - Young - 1994
[Article contains additional citations not shown here]
Documents on the same site (http://www.cs.cornell.edu/People/mpal/papers/): More
Facility Location with Nonuniform Hard Capacities - Pal, Tardos, Wexler (2001) (Correct)
Planar Finite Automata - Bezáková, Pál (1999) (Correct)
Group Strategyproof Mechanisms via Primal-Dual Algorithms - Pal, Tardos (2003) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC