The computational complexity of the k-minimum spanning tree problem in graded matrices

Computers and Mathematics with Applications

Volumn 36, Issue 5, 1998, Pages 61-67

  Dudas T ^a   Klinz, B ^a   Woeginger, G J ^a  

^a GRAZ UNIVERSITY OF TECHNOLOGY   (Austria)

Author keywords

Computational complexity; Graded matrix; Graph algorithms; K cardinality spanning tree; Minimum spanning tree

Indexed keywords

ALGORITHMS; GRAPH THEORY; MATRIX ALGEBRA; POLYNOMIALS; PROBLEM SOLVING; TREES (MATHEMATICS);

GRADED MATRICES; MINIMUM SPANNING TREE;

COMPUTATIONAL COMPLEXITY;

EID: 0032164464     PISSN: 08981221     EISSN: None     Source Type: Journal    
DOI: 10.1016/s0898-1221(98)00150-3     Document Type: Article

References (11)

1. A.Z. Zelikovsky and D.D. Lozovanu, Minimal and bounded trees, Tezele Congresului XVIII al Academiei Romano-Americane, Kishinev, pp. 25-26, (1993).
2. M. Fischetti, H.W. Harnacher, K. Jørnsten and F. Maffioli, Weighted k-cardinality trees: Complexity and polyhedral structure, Networks 24, 11-21, (1994).
3. th Annual ACM Symposium on Theory of Computing, pp. 163-172, (1994).
4. th Annual ACM Symposium on Theory of Computing, pp. 277-283, (1995).
5. S.Y. Cheung and A. Kumar, Efficient quorumcast routing algorithms, In Proceedings of the IEEE INFOCOM '94 Conference on Computer Communications, pp. 840-847, (1994).
6. R. Ravi, R. Sundaram, M.V. Marathe, D.J. Rosenkrantz and S.S. Ravi, Spanning trees short or small, SIAM Journal of Discrete Mathematics 9, 178-200, (1996).
7. G.J. Woeginger, Computing maximum valued regions, Acta Cybernetica 10, 303-315, (1992).
8. P.C. Gilmore, E.L. Lawler and D.B. Shmoys, Well-solved special cases, In The Travelling Salesman Problem, (Edited by E.L. Lawler, J.K. Lenstra, A.H.G. Rinnooy Kan and D.B. Shmoys), pp. 87-143, Chapter 4, John Wiley & Sons, Chichester, (1985).
9. T. Dudás, B. Klinz and G.J. Woeginger, The computational complexity of Steiner tree problems in graded matrices, Appl. Math. Lett. 10 (4), 35-39, (1997).
10. R.E. Burkard, V.G. Delneko, R. van Dal, J.A.A. van der Veen and G.J. Woeginger, Well-solvable special cases of the TSP: A survey, SFB-Report No. 52, SFB "Optimierung und Kontrolle", Institut für Mathematik, TU Graz, Austria, (1995); SIAM Reviews (to appear).
11. R.E. Burkard, V.G. Delneko, R. van Dal, J.A.A. van der Veen and G.J. Woeginger, Well-solvable special cases of the TSP: A survey, SFB-Report No. 52, SFB "Optimierung und Kontrolle", Institut für Mathematik, TU Graz, Austria, (1995); SIAM Reviews (to appear).