The full-degree spanning tree problem

Networks

Volumn 36, Issue 4, 2000, Pages 203-209

  Bhatia, Randeep ^a,b   Khuller, Samir ^a   Pless, Robert ^a   Sussmann, Yoram J ^a  

^a UNIVERSITY OF MARYLAND   (United States)

^b LUCENT TECHNOLOGIES   (United States)

Author keywords

Algorithm; Approximation; Full degree; Graph; NP hardness; Spanning tree

Indexed keywords

EID: 0034393289     PISSN: 00283045     EISSN: None     Source Type: Journal    
DOI: 10.1002/1097-0037(200012)36:4<203::AID-NET1>3.0.CO;2-U     Document Type: Article

References (12)

1. [1] R. Bhatia, S. Khuller, R. Pless, and Y. Sussmann, The full degree spanning tree problem, Tech. Report CS-TR-3931, University of Maryland, 1998.
2. [2] H.J. Broersma, A. Huck, T. Kloks, O. Koppius, D. Kratsch, H. Müller, and H. Tuinstra, Degree-preserving forests, Networks 35 (2000), 26-39.
3. [3] G. Galbiati, A. Morzenti, and F. Maffioli, On the approximability of some maximum spanning tree problems, Theor Comput Sci 181 (1997), 107-118.
4. [4] M.R. Garey and D.S. Johnson, Computers and intractability: A guide to the theory of NP-completeness, Freeman, San Francisco, 1979.
5. 1-∈, 37th Ann Symp on Foundations of Computer Science, 1996, pp. 627-636.
6. [6] S. Khuller, R. Bhatia, and R. Pless, On local search and placement of meters in networks, 11th Ann ACM-SIAM Symp on Discrete Algorithms, 2000, pp. 319-328.
7. [7] D.E. Knuth, The Stanford graphbase, ACM/Addison Wesley, New York, 1993.
8. [8] M. Lewinter, Interpolation theorem for the number of degree-preserving vertices of spanning trees, IEEE Trans Circ Syst CAS-34 (1987), 205.
9. [9] K. Mehlhorn and S. Näher, LEDA: A platform for combinatorial and geometric computing, Commun ACM 38 (1995), 96-102; http://mpi-sb.mpg.de/LEDA/leda.html.
10. [10] C.H. Papadimitriou and M. Yannakakis, Worst-case ratios in planar graphs and the method of induction on faces, 22nd Ann Symp on Foundations of Computer Science, 1981, pp. 358-363.
11. [11] I.W.M. Pothof and J. Schut, Graph-theoretic approach to identifiability in a water distribution network. Memorandum No 1283, Universiteit Twente, 1995.
12. [12] R.E. Tarjan, Data structures and network algorithms. Society for Industrial and Applied Mathematics, Philadelphia, 1983.