Samir Khuller, Balaji RAGHAVACHARI, NEAL YOUNG  Home/Search
Context Related
| drenchedrock.net/neal_acade...sicomp.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: drenchedrock.net/neal_academic... (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: . Given n points in the plane, the degree-K spanning tree problem asks for a spanning tree of minimum weight in which the degree of each vertex is at most K. This paper addresses the problem of computing low-weight degree-K spanning trees for K ? 2. It is shown that for an arbitrary collection of n points in the plane, there exists a spanning tree of degree three whose weight is at most 1.5 times the weight of a minimum spanning tree. It is shown that there exists a spanning tree of degree four ... (Update)
Cited by: More
Approximation Schemes for Degree-restricted MST and Red-Blue.. - Arora, Chang (2003) (Correct)
Approximation Algorithms for the Single-Sink Edge Installation.. - Jothi (2004) (Correct)
Euclidean Bounded-Degree Spanning Tree Ratios - Timothy Chan School (2003) (Correct)
Similar documents (at the sentence level):
70.6%: Low Degree Spanning Trees Of Small Weight - Khuller, Raghavachari, Young (1996) (Correct)
Active bibliography (related documents): More All
0.4: Degree-Bounded Minimum Spanning Trees - Raja Jothi Balaji (2004) (Correct)
0.2: A Network-Flow Technique for Finding Low-Weight.. - Fekete, Khuller.. (1996) (Correct)
0.2: Spanning Trees and Spanners - Eppstein (1996) (Correct)
Similar documents based on text: More All
0.5: Designing Multi-Commodity Flow Trees - Samir Khuller Balaji (1994) (Correct)
0.4: Graph and Network Algorithms - Samir Khuller Department (Correct)
0.3: Burst Segmentation: A New Approach To Reduce Packet Loss In.. - Vokkarane (2001) (Correct)
Related documents from co-citation: More All
15: Computers and Intractability: A Guide to the Theory of NP-Completeness (context) - Garey, Johnson - 1979
14: Guillotine subdivisions approximate polygonal subdivisions: A simple new method .. - Mitchell - 1996
12: On two geometric problems related to the traveling salesman problem (context) - Papadimitriou, Vazirani - 1984
BibTeX entry: (Update)
S. Khuller, B. Raghavachari, and N. Young. Low degree spanning trees of small weight. SIAM Journal on Computing, 25(2):355--368, 1996. http://citeseer.ist.psu.edu/khuller96low.html More
@inproceedings{ khuller94low,
author = "Samir Khuller and Balaji Raghavachari and Neal Young",
title = "Low degree spanning trees of small weight",
pages = "412--421",
year = "1994",
url = "citeseer.ist.psu.edu/khuller96low.html" }
Citations (may not include all citations):4212 Computers and intractability: A guide to the theory of NP-co.. (context) - Garey, Johnson - 1979
160 A general approximation technique for constrained forest pro.. - Goemans, Williamson - 1992
77 Worst-case analysis of a new heuristic for the traveling sal.. (context) - Christofides - 1975
55 Hamilton paths in grid graphs (context) - Itai, Papadimitriou et al. - 1982
50 Transitions in geometric minimum spanning trees (context) - Monma, Suri - 1992
44 Many birds with one stone: multi-objective approximation alg.. - Ravi, Marathe et al. - 1993
27 A note on the prize collecting traveling salesman problem (context) - Bienstock, Goemans et al. - 1993
24 On better heuristic for Euclidean Steiner minimum trees (context) - Du, Zhang et al. - 1991
21 A proof of the Gilbert-Pollak conjecture on the Steiner rati.. (context) - Du, Hwang - 1992
21 the relationship between the biconnectivity augmentation and.. (context) - Frederickson, J'aJ'a - 1982
19 On two geometric problems related to the traveling salesman .. (context) - Papadimitriou, Vazirani - 1984
12 Optimizing the degree of minimum weight spanning trees (context) - Fischer - 1993
11 Approximating the minimum-degree Steiner tree to within one .. (context) - urer, Raghavachari - 1994
11 Euclidean spanner graphs with degree four (context) - Salowe - 1992
10 Constructing degree-3 spanners with other sparseness propert.. (context) - Das, Heffernan - 1993
9 the maximum degree of minimum spanning trees - Robins, Salowe - 1994
4 Some extremal properties of convex sets (context) - Lillington - 1975
2 Communicated by David Johnson (context) - Bentley
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.drenchedrock.net/neal_academic/papers/): More
K-Medians, Facility Location, and the Chernoff-Wald Bound - Young (2000) (Correct)
Randomized Rounding without Solving the Linear Program - Young (1995) (Correct)
Data Collection for the Sloan Digital Sky Survey - A.. - Lupton, Maley, Young (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