On the restricted k-Steiner tree problem

Prosenjit Bose (), Anthony D’Angelo () and Stephane Durocher ()
Additional contact information
Prosenjit Bose: Carleton University
Anthony D’Angelo: Carleton University
Stephane Durocher: University of Manitoba

Journal of Combinatorial Optimization, 2022, vol. 44, issue 4, No 38, 2893-2918

Abstract: Abstract Given a set P of n points in $$\mathbb {R}^2$$ R 2 and an input line $$\gamma $$ γ in $$\mathbb {R}^2$$ R 2 , we present an algorithm that runs in optimal $$\varTheta (n\log n)$$ Θ ( n log n ) time and $$\varTheta (n)$$ Θ ( n ) space to solve a restricted version of the 1-Steiner tree problem. Our algorithm returns a minimum-weight tree interconnecting P using at most one Steiner point $$s \in \gamma $$ s ∈ γ , where edges are weighted by the Euclidean distance between their endpoints. We then extend the result to j input lines. Following this, we show how the algorithm of Brazil et al. in Algorithmica 71(1):66–86 that solves the k-Steiner tree problem in $$\mathbb {R}^2$$ R 2 in $$O(n^{2k})$$ O ( n 2 k ) time can be adapted to our setting. For $$k>1$$ k > 1 , restricting the (at most) k Steiner points to lie on an input line, the runtime becomes $$O(n^{k})$$ O ( n k ) . Next we show how the results of Brazil et al. in Algorithmica 71(1):66–86 allow us to maintain the same time and space bounds while extending to some non-Euclidean norms and different tree cost functions. Lastly, we extend the result to j input curves.

Keywords: Minimum k-Steiner tree; Steiner point restrictions; Computational geometry; Combinatorial optimization (search for similar items in EconPapers)
Date: 2022
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s10878-021-00808-z 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:44:y:2022:i:4:d:10.1007_s10878-021-00808-z

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

DOI: 10.1007/s10878-021-00808-z

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