M.X. Goemans and D.P. Williamson. A general approximation technique for constrained forest problems. SIAM J. Comput., 24:296--317, 1995. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
First 50 documents Next 50
An Approximation Algorithm for Minimum-Cost.. - Ravi, Williamson (2002) (19 citations) Self-citation (Williamson) (Correct)
No context found.
M. X. Goemans and D. P. Williamson. A general approximation technique for constrained forest problems. SIAM Journal on Computing, 24:296--317, 1995. 21
The Primal-Dual Method for Approximation Algorithms - Williamson (4 citations) Self-citation (Williamson) (Correct)
No context found.
M. X. Goemans and D. P. Williamson. A general approximation technique for constrained forest problems. SIAM Journal on Computing, 24:296--317, 1995.
A General Approximation Technique For Constrained Forest.. - Goemans, Williamson (1995) (139 citations) Self-citation (Goemans Williamson) (Correct)
No context found.
M. X. Goemans and D. P. Williamson, A general approximation technique for constrained forest problems, in Proceedings of the 3rd Annual ACM-SIAM Symposium on Discrete Algorithms, 1992, pp. 307--316. To appear in SIAM J. Comput.
A Faster, Better Approximation Algorithm for the Minimum .. - Archer, Levin.. Self-citation (Williamson) (Correct)
No context found.
M. X. Goemans and D. P. Williamson. A general approximation technique for constrained forest problems. SIAM Journal on Computing, 24:296--317, 1995.
Approximation Algorithms for Orienteering and.. - Avrim Blum Shuchi (2003) (Correct)
No context found.
M.X. Goemans and D.P. Williamson. A general approximation technique for constrained forest problems. SIAM J. Comput., 24:296--317, 1995.
Approximation Algorithms for Orienteering and.. - Avrim Blum Shuchi (2003) (Correct)
No context found.
M. Goemans and D. Williamson. A general approximation technique for constrained forest problems. In Proceedings of the 3rd Annual ACM-SIAM Symposium on Discrete Algorithms, pages 307--315, 1992.
Approximation Schemes For Node-Weighted Geometric Steiner Tree .. - Remy, Steger (2005) (Correct)
No context found.
M. X. Goemans and D. P. Williamson. A general approximation technique for constrained forest problems. SIAM Journal on Computing, 24(2):296--317, 1995.
Approximation Schemes for Node-Weighted - Geometric Steiner Tree (2005) (Correct)
No context found.
M. X. Goemans and D. P. Williamson. A general approximation technique for constrained forest problems. SIAM Journal on Computing, 24(2):296--317, 1995.
Approximation Algorithms for Finding Low-Degree Subgraphs - Klein, Krishnan.. (2004) (Correct)
No context found.
M. X. Goemans, and D. P. Williamson, A general approximation technique for constrained forest problems, SIAM J Computing 24 (1995), 296-317.
Fast and Simple Algorithms for Weighted Perfect Matching - Wattenhofer, Wattenhofer (Correct)
No context found.
M.X. Goemans and D.P. Williamson. A general approximation technique for constrained forest problems. In SODA: ACM-SIAM Symposium on Discrete Algorithms (A Conference on Theoretical and Experimental Analysis of Discrete Algorithms), 1992.
Group Strategyproof Mechanisms via Primal-Dual Algorithms - Pal, Tardos (2003) (8 citations) (Correct)
No context found.
Michel X. Goemans and David Williamson. A General Approximation Technique for Constrained Forest Problems. SIAM Journal on Computing, 24, 1995, pp 296--317.
Lagrangian Relaxation for the K-Median Problem: - New Insights And (Correct)
No context found.
M. Goemans & D.P. Williamson. A general approximation technique for constrained forest problems. SICOMP 24, 296--317, 1995.
Primal-Dual Algorithms for Connected Facility - Location Problems Chaitanya (Correct)
No context found.
M. X. Goemans and D. P. Williamson. A general approximation technique for constrained forest problems. SIAM Journal on Computing, 24:296-317, 1995. Preliminary version in SODA '94.
Approximation Algorithms for Concave Cost Network Flow Problems - Munagala (2003) (Correct)
No context found.
M. Goemans and D. Williamson. A general approximation technique for constrained forest problems. SIAM J. Comput., 24(2):296-317, April 1995.
Approximation Algorithms for Orienteering and.. - Blum, Chawla.. (2002) (Correct)
No context found.
M. Goemans and D. Williamson. A general approximation technique for constrained forest problems. In Proceedings of the3 rdAnnual ACM-SIAM Symposium on Discrete Algorithms, pages 307--315, 1992.
Budget Balanced Mechanisms for the Multicast Pricing Problem.. - Bläser, Manthey (2003) (Correct)
No context found.
M. X. Goemans, D. P. Williamson. A general approximation technique for constrained forest problems. Siam J. Comput, 24(2):296-317, 1995.
A Constant-Factor Approximation Algorithm for the.. - Kumar, Gupta.. (2002) (4 citations) (Correct)
No context found.
M. X. Goemans and D. P. Williamson. A general approximation technique for constrained forest problems. SIAM Journal on Computing, 24:296--317, 1995.
Budget Balanced Mechanisms for the Multicast Pricing Problem with .. - Bläser (2003) (Correct)
No context found.
Michel X. Goemans and David P. Williamson. A general approximation technique for constrained forest problems. Siam J. Comput, 24(2):296--317, 1995.
Primal-Dual Schema Based Approximation Algorithms - Vazirani (1995) (Correct)
No context found.
M.X. Goemans and D.P. Williamson. A general approximation technique for constrained forest problems. SIAM J. Comp., 24:296--317, 1995.
Energy-Efficient Wireless Network Design - Caragiannis, Kaklamanis.. (2003) (1 citation) (Correct)
No context found.
M. X. Goemans and D. P. Williamson. A General Approximation Technique for Constrained Forest Problems. SIAM Journal on Computing, 24:296-317, 1995.
Approximation Via Cost-Sharing: A Simple.. - Gupta, Kumar, Pal.. (2003) (1 citation) (Correct)
No context found.
M. X. Goemans and D. P. Williamson. A general approximation technique for constrained forest problems. SIAM J. Comput., 24(2):296-- 317, 1995.
Approximation via Cost-Sharing: A Simple.. - Gupta, Kumar, Pal.. (2003) (1 citation) (Correct)
No context found.
Michel X. Goemans and David P. Williamson. A general approximation technique for constrained forest problems. SIAM J. Comput., 24(2):296--317, 1995.
Approximation Algorithms for Metric Facility Location and.. - Jain, Vazirani (2001) (154 citations) (Correct)
No context found.
M. X. Goemans, D. P. Williamson. A general approximation technique for constrained forest problems. SIAM Journal of Computing, 24:296-317, 1995.
Approximation Algorithms for Finding Planar and Highly Connected .. - Fernandes (1997) (Correct)
No context found.
M. X. Goemans and D. P. Williamson, "A General Approximation Technique for Constrained Forest Problems," SIAM Journal of Computing, 24 (2), 296--317, 1995.
A Branch-and-Cut to the Point-to-Point Connection.. - Meneses, Oliveira.. (Correct)
No context found.
M. X. Goemans and D. P. Williamson. A General Approximation Technique for Constrained Forest Problems. SIAM J. Comp., 24, 1995.
First 50 documents Next 50
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