On the Euclidean bottleneck full Steiner tree problem

DOI10.1145/1998196.1998267zbMATH Open1283.68335OpenAlexW2046717228MaRDI QIDQ5404458FDOQ5404458

Authors A. Karim Abu-Affash 

Publication date 24 March 2014

Published in Proceedings of the twenty-seventh annual symposium on Computational geometry (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/1998196.1998267

zbMATH Keywords

approximation algorithmgeometric optimizationNP-hardSteiner treebottleneck full Steiner tree problem

Mathematics Subject Classification ID

Trees (05C05) Graph algorithms (graph-theoretic aspects) (05C85) Combinatorial optimization (90C27) Extremal problems in graph theory (05C35) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Approximation algorithms (68W25)

Recommendations

• The Euclidean bottleneck full Steiner tree problem
• An approximation algorithm for a bottleneck \(k\)-Steiner tree problem in the Euclidean plane
• On the full and bottleneck full Steiner tree problems
• Bottleneck bichromatic full Steiner trees
• An optimal algorithm for the Euclidean bottleneck full Steiner tree problem

Cited In (13)

• On the full and bottleneck full Steiner tree problems
• A flow-dependent quadratic Steiner tree problem in the Euclidean plane
• The Euclidean bottleneck full Steiner tree problem
• Title not available (Why is no real title available?)
• Bottleneck bichromatic full Steiner trees
• On the edge capacitated Steiner tree problem
• Bottleneck Steiner tree with bounded number of Steiner vertices
• Approximations for a bottleneck Steiner tree problem
• Title not available (Why is no real title available?)
• On the hardness of full Steiner tree problems
• On full bottleneck Steiner tree problem
• An optimal algorithm for the Euclidean bottleneck full Steiner tree problem
• An approximation algorithm for a bottleneck \(k\)-Steiner tree problem in the Euclidean plane

This page was built for publication: On the Euclidean bottleneck full Steiner tree problem

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