On Exact Solutions to the Euclidean Bottleneck Steiner Tree Problem

DOI10.1007/978-3-642-00202-1_10zbMATH Open1211.68462OpenAlexW1919263559MaRDI QIDQ3605490FDOQ3605490

Sung Hee Choi, Chunseok Lee, Sang Won Bae

Publication date: 24 February 2009

Published in: WALCOM: Algorithms and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-00202-1_10

Recommendations

• On exact solutions to the Euclidean bottleneck Steiner tree problem
• Exact algorithms for the bottleneck Steiner tree problem
• Exact algorithms for the bottleneck Steiner tree problem (extended abstract)
• An approximation algorithm for a bottleneck \(k\)-Steiner tree problem in the Euclidean plane
• An optimal algorithm for the Euclidean bottleneck full Steiner tree problem

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Cites Work

• Voronoi diagram for services neighboring a highway
• Title not available (Why is that?)
• The upper envelope of Voronoi surfaces and its applications
• Approximations for a bottleneck Steiner tree problem
• Optimal and approximate bottleneck Steiner trees
• An approximation algorithm for a bottleneck \(k\)-Steiner tree problem in the Euclidean plane

Cited In (3)

• On exact solutions to the Euclidean bottleneck Steiner tree problem
• Exact algorithms for the bottleneck Steiner tree problem (extended abstract)
• Exact solutions for the Steiner path cover problem on special graph classes

This page was built for publication: On Exact Solutions to the Euclidean Bottleneck Steiner Tree Problem

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