David P. Williamson  Home/Search
Context Related
| ibm.com/cs/people/dpw/...ismpsurvey.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: ibm.com/cs/people/dpw/ (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: In this survey, we give an overview of a technique used to design and analyze algorithms that provide approximate solutions to NP -hard problems in combinatorial optimization. Because of parallels with the primal-dual method commonly used in combinatorial optimization, we call it the primal-dual method for approximation algorithms. We show how this technique can be used to derive approximation algorithms for a number of di#erent problems, including network design problems, feedback vertex... (Update)
Context of citations to this paper: More
...method of linear programming. Since some approximation algorithms have recently been analyzed in terms of linear programming duality [11, 12], this interpretation may be useful for improving the known bound. Particularly, the dual fitting method [10, 11] seems to fit our...
Cited by: More
Primal-Dual Algorithms for Connected Facility - Location Problems Chaitanya (Correct)
A Constant-Factor Approximation Algorithm for the.. - Kumar, Gupta.. (2002) (Correct)
Greedy Edge-Disjoint Paths in Complete Graphs - Yoshio Okamoto December (Correct)
Active bibliography (related documents): More All
1.6: Approximation Algorithms for Facility Location Problems - Jens Vygen (2005) (Correct)
0.8: Approximation Algorithms Minicourse for the 23rd Conference on.. - Williamson (1998) (Correct)
0.8: A General Approximation Technique For Constrained Forest.. - Goemans, Williamson (1995) (Correct)
Similar documents based on text: More All
0.3: A Primal-Dual Interpretation - Of Two Approximation (Correct)
0.3: A Primal-Dual Interpretation of Two.. - Chudak, Goemans.. (1998) (Correct)
0.2: A Primal-Dual Schema Based Approximation Algorithm.. - Jain, Mandoiu.. (1999) (Correct)
Related documents from co-citation: More All
3: A greedy facility location algorithm analyzed using dual tting - Mahdian, Markakis et al.
3: The general Steiner tree-star problem - Khuller, Zhu - 2002
3: A Branch and Cut Algorithm for a steiner Tree-Star Problem (context) - Lee, Chiu et al.
BibTeX entry: (Update)
D.P. Williamson, The primal-dual method for approximation algorithms. Mathematical Programming , to appear. 14 http://citeseer.ist.psu.edu/689026.html More
@misc{ williamson-primaldual,
author = "D. Williamson",
title = "The primal-dual method for approximation algorithms",
text = "D.P. Williamson, The primal-dual method for approximation algorithms. Mathematical
Programming , to appear. 14",
url = "citeseer.ist.psu.edu/689026.html" }
Citations (may not include all citations):482 Combinatorial Optimization: Algorithms and Complexity (context) - Papadimitriou, Steiglitz - 1982
403 Proof verification and hardness of approximation problems - Arora, Lund et al. - 1992
403 Proof verification and the hardness of approximation problem.. - Arora, Lund et al. - 1998
354 A note on two problems in connexion with graphs (context) - Dijkstra - 1959
318 Approximation algorithms for NP-hard problems (context) - Hochbaum - 1997
301 Improved combinatorial algorithms for the facility location .. - Charikar, Guha - 1999
300 the hardness of approximating minimization problems (context) - Lund, Yannakakis - 1994
293 Approximation algorithms for combinatorial problems (context) - Johnson - 1974
235 Integer programming: methods (context) - Balinski - 1965
226 for approximating set cover (context) - Feige, of - 1998
212 Probabilistic checking of proofs: a new characterization of .. - Arora, Safra - 1998
212 Probabilistic checking of proofs; a new characterization of .. - Arora, Safra - 1992
160 A general approximation technique for constrained forest pro.. - Goemans, Williamson - 1995
146 Steiner problem in networks: a survey (context) - Winter - 1987
120 Some optimal inapproximability results (context) - Hastad - 1997
119 The Hungarian method for the assignment problem (context) - Kuhn - 1955
109 the shortest spanning subtree of a graph and the traveling s.. (context) - Kruskal - 1956
98 Zero knowledge and the chromatic number - Feige, Kilian - 1998
94 Interactive proofs and the hardness of approximating cliques - Feige, Goldwasser et al. - 1996
91 Approximation algorithms (context) - Vazirani - 2000
86 Primal-dual approximation algorithms for metric facility loc.. - Jain, Vazirani - 1999
84 an estimate of the chromatic class of a p-graph (context) - Vizing - 1964
83 Bounds for certain multiprocessor anomalies (context) - Graham - 1966
79 When trees collide: An approximation algorithm for the gener.. - Agrawal, Klein et al. - 1995
75 Approximation algorithms for the set covering and vertex cov.. (context) - Hochbaum - 1982
71 Maximal flow through a network (context) - Ford, Fulkerson - 1956
70 Primal-dual approximation algorithms for integral flow and m.. (context) - Garg, Vazirani et al. - 1997
65 The primal-dual method for approximation algorithms and its .. (context) - Goemans, Williamson - 1997
49 Clique is hard to approximate within n - Hastad - 1999
47 approximation for the minimum tree spanning k vertices (context) - Garg - 1996
46 Improved approximation algorithms for network design problem.. - Goemans, Goldberg et al. - 1994
38 The prize collecting traveling salesman problem (context) - Balas - 1989
37 A factor 2 approximation algorithm for the generalized Stein.. - Jain - 2001
34 Computing near-optimal solutions to combinatorial optimizati.. - Shmoys - 1995
33 Canadian Journal of Mathematics (context) - Edmonds, trees - 1965
32 A local-ratio theorem for approximating the weighted vertex .. (context) - Bar-Yehuda, Even - 1985
31 A dual-based procedure for uncapacitated facility location (context) - Erlenkotter - 1978
28 Euler tours and the Chinese postman (context) - Edmonds, Johnson - 1973
27 When cycles collapse: A general approximation technique for .. - Klein, Ravi - 1993
24 and nonapproximability -- towards tight results (context) - Bellare, Goldreich et al. - 1998
23 The prize-collecting Steiner tree problem: theory and practi.. - Johnson, Minko et al. - 2000
21 A linear time approximation algorithm for the weighted verte.. (context) - Bar-Yehuda, Even - 1981
20 A dual ascent approach for Steiner tree problems on a direct.. (context) - Wong - 1984
17 A unified approach to approximating resource allocation and .. (context) - Bar-Noy, Bar-Yehuda et al. - 2000
15 Primal-dual approximation algorithms for feedback problems i.. - Goemans, Williamson - 1998
14 approximation algorithm for the undirected feedback vertex s.. (context) - Bafna, Berman et al. - 1999
14 cient probabilistically checkable proofs and applications to.. (context) - Bellare, Goldwasser et al. - 1993
13 Approximating minimum subset feedback sets in undirected gra.. - Even, Naor et al. - 2000
11 the bidirected cut relaxation for the metric Steiner tree pr.. - Rajagopalan, Vazirani - 1999
11 the design of approximation algorithms for a class of graph .. (context) - Williamson - 1993
11 A dual-ascent procedure for large-scale uncapacitated networ.. (context) - Balakrishnan, Magnanti et al. - 1989
10 Optimization of Pearl's method of conditioning and greedy-li.. - Becker, Geiger - 1996
10 Computational experience with an approximation algorithm on .. (context) - Williamson, Goemans - 1996
9 One for the price of two: a unified approach for approximati.. (context) - Bar-Yehuda
9 the approximability of the traveling salesman problem - Papadimitriou, Vempala - 2000
7 commercial application survivable network design ITPINPLAN C.. (context) - Dean, application et al. - 1996
7 Approximation algorithms for the feedback vertex set problem.. (context) - Bar-Yehuda, Geiger et al. - 1998
6 cient approximation algorithm for the survivable network des.. (context) - Gabow, Goemans et al. - 1998
6 Steiner trees via the primal-dual method and Lagrangean rela.. (context) - Chudak, Roughgarden et al. - 2001
5 A primal-dual approach to approximation algorithms for netwo.. (context) - Saran, Vazirani et al. - 1992
4 with application to speeding up an approximation algorithm (context) - Klein, structure et al. - 1994
4 the maximal number of disjoint circuits of a graph (context) - Erdos, Posa - 1962
4 A primal-dual algorithm for linear programs (context) - Dantzig, Ford et al. - 1956
4 Approximating minimum-cost graph problems with spanning tree.. (context) - Goemans, Williamson - 1994
3 A new heuristic for rectilinear Steiner trees - Mandoiu, Vazirani et al. - 1999
3 An approximation algorithm for general graph connectivity pr.. (context) - Williamson, Goemans et al. - 1995
2 Constructing approximation algorithms via linear programming.. (context) - Teo - 1996
2 A primal-dual interpretation of two 2-approximation algorith.. - Chudak, Goemans et al. - 1998
2 From valid inequalities to heuristics: A unified view of pri.. (context) - Bertsimas, Teo - 1998
2 Journal of Research of the National Bureau of Standards B (context) - Edmonds - 1967
2 Approximating node-deletion problems for matroidal propertie.. (context) - Fujito - 1999
1 Grafok paros koruljarasu reszgrafjairol (context) - Erdos - 1967
1 Formulations and algorithms for network design problems with.. (context) - Raghavan - 1994
Documents on the same site (http://www.almaden.ibm.com/cs/people/dpw/): More
Gadgets, Approximation, and Linear Programming - Trevisan, Sorkin, Sudan.. (2000) (Correct)
Unknown - (Correct)
New 3/4-Approximation Algorithms for MAX SAT - Goemans, Williamson (1994) (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