An exact algorithm for the line-constrained bottleneck \(k\)-Steiner tree problem

DOI10.1007/978-3-031-49611-0_31MaRDI QIDQ6606207

Junran Lichen, Suding Liu, Jianping Li

Publication date: 16 September 2024

zbMATH Keywords

Steiner pointscomputational geometryexact algorithmsline-constrained bottleneck Steiner treeoriented Voronoi diagram

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Cites Work

• Title not available (Why is that?)
• Exact algorithms for the bottleneck Steiner tree problem
• On exact solutions to the Euclidean bottleneck Steiner tree problem
• An optimal algorithm for constructing oriented Voronoi diagrams and geograph neighborhood graphs
• Approximations for a bottleneck Steiner tree problem
• Optimal and approximate bottleneck Steiner trees
• A constrained minimum spanning tree problem
• An approximation algorithm for a bottleneck \(k\)-Steiner tree problem in the Euclidean plane
• Combinatorial optimization. Polyhedra and efficiency (3 volumes)
• On the restricted \(k\)-Steiner tree problem
• Approximation algorithms for solving the 1-line Euclidean minimum Steiner tree problem
• Approximation algorithms and hardness results for packing element-disjoint Steiner trees in planar graphs
• Optimal relay location for resource-limited energy-efficient wireless communication
• The Design of Approximation Algorithms
• Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems
• The 1-steiner tree problem
• The Complexity of Computing Steiner Minimal Trees
• Guillotine Subdivisions Approximate Polygonal Subdivisions: A Simple Polynomial-Time Approximation Scheme for Geometric TSP, k-MST, and Related Problems
• A minimum spanning tree algorithm with inverse-Ackermann type complexity
• Tighter Bounds for Graph Steiner Tree Approximation
• Bottleneck Steiner trees in the plane
• Steiner Tree Approximation via Iterative Randomized Rounding
• Combinatorial optimization. Theory and algorithms.

This page was built for publication: An exact algorithm for the line-constrained bottleneck \(k\)-Steiner tree problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6606207)