Md-MST is NP-hard for d ≥ 3

Electronic Notes in Discrete Mathematics

Volumn 36, Issue C, 2010, Pages 9-15

  De Almeida, Ana Maria ^a   Martins, Pedro ^b   Souza, Maurício C ^c  

^a UNIVERSITY OF COIMBRA   (Portugal)

^b POLYTECHNIC INSTITUTE OF COIMBRA   (Portugal)

^c FEDERAL UNIVERSITY OF MINAS GERAIS   (Brazil)

Author keywords

Computational complexity; Node degree constraints; Proof by reduction; Spanning tree

Indexed keywords

EID: 77954918693     PISSN: 15710653     EISSN: 15710653     Source Type: Journal    
DOI: 10.1016/j.endm.2010.05.002     Document Type: Article

References (6)

1. Almeida, A.M.de, P.C. Martins, and M. Souza, "Min-Degree Constrained Minimum Spanning Tree Problem: Complexity, properties, and formulations", Working Paper 6 (2006), Center for Operational Research of the University of Lisbon.
2. Garey M.R., Johnson D.S. Computers and intractability: A guide to the theory of NP-completeness 1979, W.H. Freeman, San Francisco.
3. Imielińska C., Kalantari B., Khachiyan L. A greedy heuristic for a minimum-weight forest problem. Operations Research Letters 1993, 14:65-71.
4. Monma C., Suri S. Transitions in geometric minimum spanning trees. Discrete Computational Geometry 1992, 8:265-293.
5. Papadimitriou C.H. Computational Complexity 1994, Addinson-Wesley.
6. Papadimitriou C.H., Vazirani U.V. On two geometric problems related to the traveling salesman problem. Journal of Algorithms 1984, 5:231-246.