Approximating the minimum degree spanning tree to within one from the optimal degree

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn Part F129721, Issue , 1992, Pages 317-324

  Fürer, Martin ^a   Raghavachari, Balaji ^a  

^a PENNSYLVANIA STATE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION ALGORITHMS; DIRECTED GRAPHS; GRAPH THEORY; ITERATIVE METHODS; POLYNOMIAL APPROXIMATION;

GRAPH G; MAXIMAL DEGREE; MINIMUM DEGREE; POLYNOMIAL TIME APPROXIMATION ALGORITHMS; POLYNOMIAL-TIME; SPANNING TREE; STEINER;

TREES (MATHEMATICS);

EID: 85026575220     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (22)

1. K. Appel and W. Haken, Every planar map is four-colorable, Illinois J. Math. 21 (1977), 429567.
2. A. Agrawal, P. Klein, S. Rao and R. Ravi, Approximation through Multicommodity Flow, Proc. of 31st FOCS (1990), 726-737.
3. A. Agrawal, P. Klein and R. Ravi, When Trees Collide: An Approximation Algorithm for the Generalized Steiner Problem on Networks, Proc. of 23rd STOC (1991), 134-144.
4. A. Agrawal, P. Klein and R. Ravi, Ordering Problems Approximated: Single-Processor Scheduling and Interval Graph Completion, Proc. of 18th ICALP (1991), LNCS 510, 751-762.
5. A. Agrawal, P. Klein and R. Ravi, How Tough is the Minimum-degree Steiner Tree? A New Approximate Min-max Equality, Personal Communication.
6. P.M. Camerini and G. Galbiati, The Bounded Path Tree Problem, SIAM J. Algeb. Disc. Meth. 3, (1982) 474-484.
7. P.M. Camerini, G. Galbiati and F. Maffioli, Complexity of Spanning Tree Problems: Part I, European J. Oper. Res. 5 (1980) 346-352.
8. P.M. Camerini, G. Galbiati and F. Maffioli, On the Complexity of Finding Multi-constrained Spanning Trees, Disc. Appi Math. 5 (1983) 3950.
9. V. Chvatal, Tough Graphs and Hamiltonian Circuits, Disc. Math. 5 (1973), 215-228.
10. M. Furer and B. Raghavachari, An NC Approximation Algorithm for the Minimum Degree Spanning Tree Problem, Proceedings of the 28th Annual Allerton Conference on Communication, Control and Computing (1990), 274-281.
11. H. Garcia-Molina and B. Kogan, An Implementation of Reliable Broadcast Using an Unreliable Multicast Facility, Proc. Seventh Symp. on Reliable Dist. Syst. (1988) 101-111.
12. M.R. Garey and D.S. Johnson, "Computers and Intractability: A Guide to the Theory of NP-completeness, " W.H. Freeman, 1979.
13. M.R. Garey, D.S. Johnson and L. Stockmeyer, Some Simplified ./VP-complete Graph Problems, Theor. Comput. Sci. 1 (1976), 237-267.
14. I. Holyer, The NP-Completeness of Edge-Coloring, SIAM J. Comput. 10 (1981) 718-720.
15. D.S. Johnson, The JVP-conipleteness Column: An Ongoing Guide, /. Algorithms 6 (1985) 145-159.
16. F.T. Leighton, F. Makedon, S. Plotkin, C. Stein, E. Tardos and S. Tragoudas, Fast Approximation Algorithms for Multicommodity Flow Problems, Proc. of 23rd STOC (1991), 101-111.
17. F.T. Leighton and S. Rao, An Approximate Max-Flow Min-Cut Theorem for Uniform Multicommodity Flow Problems with Applications to Approximation Algorithms, Proc. of 29th FOCS (1988), 422-431.
18. J.K. Lenstra, D.B. Shmoys and E. Tardos, Approximation Algorithms for Scheduling Unrelated Parallel Machines, Proc. of 28th FOCS (1987), 217-224.
19. CH. Papadimitriou and M. Yannakakis, The complexity of restricted spanning tree problems, JACM 29 (1982), 285-309.
20. S.A. Plotkin, D.B. Shmoys and E. Tardos, Fast Approximation Algorithms for Fractional Packing and Covering Problems, Proc. of 32nd FOCS (1991), 495-504.
21. H. Saran and V.V. Vwsirani, Finding a k-Cut within Twice the Optimal, Proc. of 32nd FOCS (1991), 743-751.
22. V.G. Vizing, On an estimate of the chromatic class of a p-graph (Russian), Diskret. Anal. 3 (1964) 25-30.