The Euclidean bottleneck Steiner path problem and other applications of \((\alpha ,\beta )\)-pair decomposition
From MaRDI portal
Publication:2441579
DOI10.1007/s00454-013-9550-9zbMath1311.68095OpenAlexW1995956127MaRDI QIDQ2441579
A. Karim Abu-Affash, Matthew J. Katz, Michael Segal, Paz Carmi
Publication date: 25 March 2014
Published in: Discrete \& Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00454-013-9550-9
Programming involving graphs or networks (90C35) Graph theory (including graph drawing) in computer science (68R10) Combinatorial optimization (90C27) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Graph representations (geometric and intersection representations, etc.) (05C62) Inequalities and extremum problems in real or complex geometry (51M16)
Related Items
Computing directed Steiner path covers ⋮ Fixed parameter tractability of a biconnected bottleneck Steiner network problem ⋮ Survivable minimum bottleneck networks ⋮ Computing Directed Steiner Path Covers for Directed Co-graphs (Extended Abstract)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Steiner tree problem with minimum number of Steiner points and bounded edge-length
- New constructions of SSPDs and their applications
- On bounded leg shortest paths problems
- On exact solutions to the Euclidean bottleneck Steiner tree problem
- On separating systems
- Region-fault tolerant geometric spanners
- Approximations for a bottleneck Steiner tree problem
- Fast algorithms for approximating distances
- An approximation algorithm for a bottleneck \(k\)-Steiner tree problem in the Euclidean plane
- Generalized Selection and Ranking: Sorted Matrices
- Geometric Spanner Networks
- Communication-Efficient Construction of the Plane Localized Delaunay Graph
- On Constructing Minimum Spanning Trees in k-Dimensional Spaces and Related Problems
- A decomposition of multidimensional point sets with applications to k -nearest-neighbors and n -body potential fields
- An Expander-Based Approach to Geometric Optimization
- ON ENUMERATING AND SELECTING DISTANCES
- Net and prune
- Principles of Distributed Systems
- Approximations for Steiner trees with minimum number of Steiner points
