Vijay V. Vazirani  Home/Search
Context Related
| CS.McGill.CA/~ptesso/barbad...vijay3.ps Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: CS.McGill.CA/~ptesso/barbados/ (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: The primal--dual schema, a general algorithm design method, has yielded approximation algorithms for a diverse collection of NP-hard problems. Perhaps its most remarkable feature is that despite its generality, it has yielded algorithms with good approximation guarantees as well as good running times. (Update)
Cited by: More
Approximation Algorithms for Metric Facility Location and.. - Jain, Vazirani (2001) (Correct)
Enhancing Techniques in LP Based Approximation Algorithms - Jain (Correct)
Active bibliography (related documents): More All
0.8: Approximation Algorithms for Facility Location Problems - Jens Vygen (2005) (Correct)
0.6: The Primal-Dual Method for Approximation Algorithms - Williamson (Correct)
0.2: Approximation Algorithms Minicourse for the 23rd Conference on.. - Williamson (1998) (Correct)
System load high. Please wait...
Timeout. Please try your query later.
Similar documents based on text: More All
0.5: On the Bidirected Cut Relaxation for the Metric Steiner.. - Rajagopalan, Vazirani (1999) (Correct)
0.4: Primal-Dual Approximation Algorithms for Metric Facility.. - Jain, Vazirani (1999) (Correct)
0.2: A Primal-Dual Schema Based Approximation Algorithm.. - Jain, Mandoiu.. (1999) (Correct)
Related documents from co-citation: More All
4: Improved approximation algorithms for uncapacitated facility location - Chudak - 1998
4: Improved approximation algorithms for the capacitated facility location problem - Chudak, Shmoys - 1999
2: Maximum matching and a polyhedron with (context) - Edmonds - 1965
BibTeX entry: (Update)
V. V. Vazirani. Primal-dual schema based approximation algorithms. In Proc. 1st Annual International Conference, COCOON, pages 650--652, 1995. http://citeseer.ist.psu.edu/vazirani95primaldual.html More
@inproceedings{ vazirani95primaldual,
author = "Vijay V. Vazirani",
title = "Primal-Dual Schema Based Approximation Algorithms (Abstract)",
booktitle = "Computing and Combinatorics",
pages = "650-652",
year = "1995",
url = "citeseer.ist.psu.edu/vazirani95primaldual.html" }
Citations (may not include all citations):333 Geometric algorithms and combinatorial optimization (context) - Grotschel, Lov'asz et al. - 1993
160 A general approximation technique for constrained forest pro.. - Goemans, Williamson - 1995
159 Approximation algorithms for the metric facility location an.. - Jain, Vazirani
119 The Hungarian method for the assignment problem (context) - Kuhn - 1955
117 The ellipsoid method and its consequences in combinatorial o.. (context) - Grotschel, Lov'asz et al. - 1981
91 Approximation Algorithms (context) - Vazirani - 2001
65 The primal--dual method for approximation algorithms and its.. (context) - Goemans, Williamson - 1997
61 A primal--dual approximation algorithm for generalized Stein.. (context) - Williamson, Goemans et al. - 1995
56 Maximum matching and a polyhedron with (context) - Edmonds - 1965
45 approximation algorithm for the network Steiner problem (context) - Zelikovsky - 1993
42 Worst-case analysis of a new heuristic for the travelling sa.. (context) - Christofides - 1976
37 Applications of Approximation Algorithms to Cooperative Game.. - Jain, Vazirani - 2000
37 A factor 2 approximation algorithm for the generalized Stein.. - Jain
24 An algorithmic theory of numbers (context) - Lov'asz - 1986
21 A linear-time approximation algorithm for the weighted verte.. (context) - Bar-Yehuda, Even - 1981
16 linear programming and branch and bound (context) - Wolsey - 1980
16 RNC-approximation algorithms for the Steiner problem - Promel, Steger - 1997
11 the bidirected cut relaxation for the metric Steiner tree pr.. - Rajagopalan, Vazirani - 1999
6 steiner trees via the primal--dual method and lagrangean rel.. (context) - Chudak, Roughgarden et al. - 2000
4 A primal--dual algorithm for linear programs (context) - Dantzig, Ford et al. - 1956
2 When trees colide: an approximation algorithm for the genera.. (context) - Agrawal, Klein et al. - 1995
Documents on the same site (http://www.CS.McGill.CA/~ptesso/barbados/): More
On the Computational Power of Boolean Decision Lists - Krause (2002) (Correct)
Approximation Algorithms for Metric Facility Location and.. - Jain, Vazirani (2001) (Correct)
Power from Random Strings - Allender, Koucky, Ronneburger (2001) (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