Avrim Blum, R. Ravi, Santosh Vempala  Home/Search
Context Related
| cmu.edu/~avrim/Pap...ree_constant.ps.gz cmu.edu/usr/avrim/...ree_constant.ps.gz cmu.edu/local/mosa...ree_constant.ps.gz 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: cmu.edu/~avrim/Papers/pubs (more) From: cmu.edu/local/mosaic/commo...pubs (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: Given an undirected graph with non-negative edge costs and an integer k, the k-MST problem is that of finding a tree of minimum cost on k nodes. This problem is known to be NP-hard. We present a simple approximation algorithm that finds a solution whose cost is less than 17 times the cost of the optimum. This improves upon previous performance ratios for this problem -- O( p k) due to Ravi et al., O(log 2 k) due to Awerbuch et al, and the previous best bound of O(log k) due to ... (Update)
Cited by: More
Approximation Algorithms for Orienteering and.. - Avrim Blum Shuchi (2003) (Correct)
Approximation Algorithms for the Single-Sink Edge Installation.. - Jothi (2004) (Correct)
Traveling Salesman Problems With Profits: An Overview - Feillet, Dejax, Gendreau (2001) (Correct)
Similar documents (at the sentence level):
64.1%: A Constant-factor Approximation Algorithm for the k-MST Problem.. - Blum, al. (1996) (Correct)
Active bibliography (related documents): More All
0.4: New Approximation Guarantees for Minimum-Weight.. - Awerbuch, Azar, Blum, .. (1999) (Correct)
0.3: A Constant-Factor Approximation Algorithm for the.. - Mitchell, Blum.. (1998) (Correct)
0.2: Local Search Algorithms for the k-Cardinality Tree Problem - Blum, Ehrgott (Correct)
Similar documents based on text: More All
0.8: The Prize Collecting Steiner Tree Problem - Minkoff (1998) (Correct)
0.5: A 2.5 Factor Approximation Algorithm for the k-MST Problem - Arya, Ramesh (1997) (Correct)
0.4: A Faster Implementation of the Goemans-Williamson.. - Cole, Hariharan.. (2001) (Correct)
Related documents from co-citation: More All
17: General approximation technique for constrained forest problems - Goemans, Williamson - 1992
12: approximation for the minimum tree spanning k vertices (context) - Garg - 1996
11: Improved approximation guarantees for minimum-weight k-trees and prize-collectin.. - Awerbuch, Azar et al. - 1995
BibTeX entry: (Update)
A. Blum, R. Ravi, and S. Vempala, A constant-factor approximation algorithm for the k- MST problem, Proc. 28th Annu. ACM Sympos. Theory Comput. (1996), pp. 442--448. http://citeseer.ist.psu.edu/article/blum96constantfactor.html More
@inproceedings{ blum96constantfactor,
author = "Avrim Blum and R. Ravi and Santosh Vempala",
title = "A Constant-factor Approximation Algorithm for the k {MST} Problem (Extended Abstract)",
booktitle = "{ACM} Symposium on Theory of Computing",
pages = "442-448",
year = "1996",
url = "citeseer.ist.psu.edu/article/blum96constantfactor.html" }
Citations (may not include all citations):160 A general approximation technique for constrained forest pro.. - Goemans, Williamson
127 Guillotine subdivisions approximate polygonal subdivisions: .. - Mitchell - 1996
127 Guillotine subdivisions approximate polygonal subdivisions: .. - Mitchell - 1996
51 The minimum latency problem - Blum, Chalasani et al. - 1994
50 An improved approximation ratio for the minimum latency prob.. - Goemans, Kleinberg - 1996
47 Approximation for the Minimum Tree Spanning k Vertices (context) - Garg - 1996
43 Improved approximation guarantees for minimum-weight k-trees.. - Awerbuch, Azar et al. - 1995
38 The prize collecting traveling salesman problem (context) - Balas - 1989
33 minimum spanning tree problem in the plane (context) - Garg, Hochbaum et al. - 1994
33 A constant-factor approximation for the k-MST problem in the.. (context) - Blum, Chalasani et al. - 1995
19 Spanning trees short and small (context) - Ravi, Sundaram et al. - 1994
15 Minimal and bounded trees (context) - Zelikovsky, Lozevanu - 1993
13 Naval Research Logistics (context) - Golden, Levy et al. - 1987
11 Logarithmic approximation of minimum weight k trees (context) - Rajagopalan, Vazirani - 1995
1 Weighted kcardinality treecomplexity and polyhedral structur.. (context) - Jrnsten, kcardinality et al. - 1994
1 Plynomial-time approximation schemes for Euclidean TSP and o.. (context) - Arora - 1996
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.cs.cmu.edu/~avrim/Papers/pubs.html): More
Linear Approximation of Shortest Superstrings - Blum, Jiang, Li, Tromp.. (1991) (Correct)
Universal Portfolios With and Without Transaction Costs - Blum, Kalai (1997) (Correct)
A Polynomial-time Algorithm for Learning Noisy Linear.. - Blum, Frieze, Kannan, .. (1996) (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