The Steiner Tree Problem in Kalmanson Matrices and in Circulant Matrices

Bettina Klinz () and Gerhard J. Woeginger ()
Additional contact information
Bettina Klinz: Institut für Mathematik, TU Graz
Gerhard J. Woeginger: Institut für Mathematik, TU Graz

Journal of Combinatorial Optimization, 1999, vol. 3, issue 1, No 4, 58 pages

Abstract: Abstract We investigate the computational complexity of two special cases of the Steiner tree problem where the distance matrix is a Kalmanson matrix or a circulant matrix, respectively. For Kalmanson matrices we develop an efficient polynomial time algorithm that is based on dynamic programming. For circulant matrices we give an $$\mathcal{N}\mathcal{P}$$ -hardness proof and thus establish computational intractability.

Keywords: Steiner tree; Kalmanson matrix; circulant matrix; computational complexity; graph algorithms (search for similar items in EconPapers)
Date: 1999
References: View complete reference list from CitEc
Citations: View citations in EconPapers (3)

Downloads: (external link)
http://link.springer.com/10.1023/A:1009881510868 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:jcomop:v:3:y:1999:i:1:d:10.1023_a:1009881510868

Ordering information: This journal article can be ordered from
https://www.springer.com/journal/10878

DOI: 10.1023/A:1009881510868

Access Statistics for this article

Journal of Combinatorial Optimization is currently edited by Thai, My T.

More articles in Journal of Combinatorial Optimization from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().