The euclidean bottleneck steiner path problem (original) (raw)
Related papers
The Euclidean Bottleneck Steiner Path Problem and Other Applications of (α,β)-Pair Decomposition
Discrete & Computational Geometry, 2013
On the euclidean bottleneck full Steiner tree problem
Proceedings of the twenty-seventh annual symposium on Computational geometry, 2011
Minimum Weight Convex Steiner Partitions
Algorithmica, 2009
The Euclidean Bottleneck Full Steiner Tree Problem
Algorithmica, 2013
Spanners for geometric intersection graphs with applications
Journal of Computational Geometry, 2012
An Approximation Algorithm for the Euclidean Bottleneck Steiner Tree Problem
On-line steiner trees in the Euclidean plane
Discrete & Computational Geometry, 1993
On bounded leg shortest paths problems
Algorithmica (New York), 2011
On a Combinatorial Approach to Studying the Steiner Diameter of a Graph and Its Line Graph
Mathematics
Additive Spanners for Circle Graphs and Polygonal Graphs
Lecture Notes in Computer Science, 2008
The Metric Bridge Partition Problem
2005
Approximating Euclidean distances by small degree graphs
Discrete & Computational Geometry, 1994
Designing Steiner Networks with Unicyclic Connected Components: An Easy Problem
SIAM Journal on Discrete Mathematics, 2010
The Steiner problem with edge lengths 1 and 2
Information Processing Letters, 1989
New Benchmark Instances for the Steiner Problem in Graphs
2001
Low-Light Trees, and Tight Lower Bounds for Euclidean Spanners
Discrete & Computational Geometry, 2010
Geometric spanners for weighted point sets
Algorithms-ESA …, 2009
Geometric spanners with applications in wireless networks
Computational Geometry, 2007
On the minimum diameter spanning tree problem
Information Processing Letters, 1995
Polynomially solvable special cases of the Steiner problem in planar networks
Annals of Operations Research, 1991
Finding a minimum-weightk-link path in graphs with the concave Monge property and applications
Discrete & Computational Geometry, 1994
The Steiner connectivity problem
Mathematical Programming, 2012
Some structural and geometric properties of two-connected steiner networks
2007
A Robust and Scalable Algorithm for the Steiner Problem in Graphs
Spanning Trees in Hypergraphs with Applications to Steiner Trees
Cutting corners cheaply, or how to remove Steiner points
Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, 2013
Some Formulations for the Group Steiner Tree Problem
Electronic Notes in Discrete Mathematics, 2004
The Minimum Degree Group Steiner Tree problem on Bounded Treewidth Graphs and Applications
2019
Spanners for Geometric Intersection Graphs
Lecture Notes in Computer Science
On Approximation of the Power-p and Bottleneck Steiner Trees
Combinatorial Optimization, 2000
Near-Optimal Compression for the Planar Graph Metric
Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 2018
Journal of Graph Theory, 1990