Algorithms for the minimum diameter terminal Steiner tree problem

Wei Ding () and Ke Qiu ()
Additional contact information
Wei Ding: Zhejiang Water Conservancy and Hydropower College
Ke Qiu: Brock University

Journal of Combinatorial Optimization, 2014, vol. 28, issue 4, No 10, 837-853

Abstract: Abstract Given an undirected connected graph $$G=(V(G),E(G),d)$$ with a function $$d(\cdot )\ge 0$$ on edges and a subset $$S\subseteq V(G)$$ of terminals, the minimum diameter terminal Steiner tree problem (MDTSTP) asks for a terminal Steiner tree in $$G$$ of a minimum diameter. In the paper, the diameter of a tree refers to the longest of all the distances between two different leaves of the tree. When $$G$$ is a complete graph and $$d(\cdot )$$ is a metric function, we demonstrate that an optimal solution of MDTSTP is monopolar or dipolar and give an $$O(|S|\cdot |V(G)\setminus S|^2)$$ -time exact algorithm. For the nonmetric version of MDTSTP, we present a simple 2-approximation algorithm with a time complexity of $$O(|V(G)\setminus S|\log |S|)$$ , as well as two exact algorithms with a time complexity of $$O(|S|^3|V(G)|^2)$$ and $$O(|S|\cdot |V(G)\setminus S|^2+|S|^2\cdot |V(G)\setminus S|)$$ , respectively.

Keywords: Time Complexity; Approximation Algorithm; Complete Graph; Steiner Tree; Exact Algorithm (search for similar items in EconPapers)
Date: 2014
References: View complete reference list from CitEc
Citations: View citations in EconPapers (2)

Downloads: (external link)
http://link.springer.com/10.1007/s10878-012-9591-7 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:28:y:2014:i:4:d:10.1007_s10878-012-9591-7

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

DOI: 10.1007/s10878-012-9591-7

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 ().