Sándor P. Fekete, Samir Khuller, Monika Klemmstein, Balaji Raghavachari, Neal Young  Home/Search
Context Related
| drenchedrock.net/n...erallowdegree.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 a graph with edge weights satisfying the triangle inequality, and a degree bound for each vertex, the problem of computing a low weight spanning tree such that the degree of each vertex is at most its specified bound is considered. In particular, modifying a given spanning tree T using adoptions to meet the degree constraints is considered. A novel network-flow based algorithm for finding a good sequence of adoptions is introduced. The method yields a better performance guarantee ... (Update)
Context of citations to this paper: More
.... points in reasonable computing times [6] 18] and several authors have described e#ective polynomial time approximation schemes and heuristics [57], 58] In general, however, edge costs need not satisfy the triangle inequality. An unconstrained minimum spanning tree may have...
...hundred vertices in reasonable computing times. Furthermore, there exist effective polynomial time heuristics for finding d MSTs in the plane [7, 25]. In the more general case, the costs associated with the graph s edges are arbitrary and need not satisfy the triangle...
Cited by: More
Approximation Algorithms for the Single-Sink Edge Installation.. - Jothi (2004) (Correct)
Euclidean Bounded-Degree Spanning Tree Ratios - Timothy Chan School (2003) (Correct)
A Weighted Coding in a Genetic Algorithm for the.. - Raidl (2000) (Correct)
Similar documents (at the sentence level):
76.6%: A Network-Flow Technique for Finding Low-Weight.. - Fekete, Khuller.. (1995) (Correct)
Active bibliography (related documents): More All
0.3: Small Degree Out-Branchings - Rgen Bang-Jensen St (Correct)
0.3: Degree-Bounded Minimum Spanning Trees - Raja Jothi Balaji (2004) (Correct)
0.2: Spanning Trees and Spanners - Eppstein (1996) (Correct)
Similar documents based on text: More All
0.2: Worst-Case Ratios for Degree-Constrained Trees - Fekete, Klemmstein (1995) (Correct)
0.2: Burst Segmentation: A New Approach To Reduce Packet Loss In.. - Vokkarane (2001) (Correct)
0.1: On approximately fair cost allocation in Euclidean TSP.. - Faigle, Fekete.. (1996) (Correct)
Related documents from co-citation: More All
9: Transitions in geometric minimum spanning trees (context) - Monma, Suri - 1991
8: On two geometric problems related to the traveling salesman problem (context) - Papadimitriou, Vazirani - 1984
6: Computers and Intractability: A Guide to the Theory of NP-Completeness (context) - Garey, Johnson - 1979
BibTeX entry: (Update)
S.P.Fekete, S.Khuller, M.Klemmstein, B.Raghavachari and N.Young, A network flow technique for finding low-weight boundeddegree spanning trees, ZPR Technical Report 95-208, 1995. http://citeseer.ist.psu.edu/article/fekete96networkflow.html More
@inproceedings{ fekete96networkflow,
author = "S. P. Fekete and S. Khuller and M. Klemmstein and B. Raghavachari and N. Young",
title = "A network-flow technique for finding low-weight bounded-degree trees",
booktitle = "Proceedings of the 5th International Integer Programming and Combinatorial Optimization {IPCO} Conference. 3-5 Jun 1996. Vancouver, British Columbia, Canada",
volume = "1084",
publisher = "Springer-Verlag",
editor = "W. H. Cunningham and S. T. McCormick and M. Queyranne",
pages = "105--117",
year = "1996",
url = "citeseer.ist.psu.edu/article/fekete96networkflow.html" }
Citations (may not include all citations):4212 Computers and intractability: a guide to the theory of NP-co.. (context) - Garey, Johnson - 1979
151 algorithms and applications (context) - Ahuja, Magnanti et al. - 1993
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
30 Design of survivable networks (context) - Stoer - 1992
29 Methods for designing communication networks with certain tw.. (context) - Monma, Shallcross - 1989
25 Low degree spanning trees of small weight - Khuller, Raghavachari et al. - 1994
21 Balancing minimum spanning trees and shortest-path trees - Khuller, Raghavachari et al. - 1995
19 On two geometric problems related to the traveling salesman .. (context) - Papadimitriou, Vazirani - 1984
18 alowe. Low-degree minimum spanning trees - Robins - 1995
16 Approximating the minimum-degree Steiner tree to within one .. (context) - Furer, Raghavachari - 1994
16 Topological design of centralized computer networks --- form.. (context) - Gavish - 1982
15 Degree-constrained minimum spanning tree (context) - Narula, Ho - 1980
12 Optimizing the degree of minimum weight spanning trees (context) - Fischer - 1993
11 Euclidean spanner graphs with degree four (context) - Salowe - 1994
9 Edge exchanges in the degree-constrained minimum spanning tr.. (context) - Savelsbergh, Volgenant - 1985
7 Efficient algorithms for a family of matroid intersection pr.. (context) - Gabow, Tarjan - 1984
5 A matroid algorithm and its application to the efficient sol.. (context) - Brezovec, Cornu'ejols et al. - 1988
4 A good algorithm for smallest spanning trees with a degree c.. (context) - Gabow - 1978
3 Finding minimum spanning trees with a fixed number of links .. (context) - Glover, Klingman - 1975
3 A Lagrangean approach to the degree-constrained minimum span.. (context) - Volgenant - 1989
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