A Near-Tight Bound for the Online Steiner Tree Problem in Graphs of Bounded Asymmetry

DOI10.1007/978-3-540-87744-8_7zbMath1158.68425OpenAlexW2127581878MaRDI QIDQ3541076

Spyros Angelopoulos

Publication date: 25 November 2008

Published in: Algorithms - ESA 2008 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-87744-8_7

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Related Items (4)

Online Priority Steiner Tree Problems ⋮ Mixed integer programming formulations for Steiner tree and quality of service multicast tree problems ⋮ The Bursty Steiner Tree Problem ⋮ Parameterized analysis of the online priority and node-weighted Steiner tree problems

Cites Work

• Linear bounds for on-line Steiner problems
• On-line Steiner trees in the Euclidean plane
• On-line generalized Steiner problem
• A survey of combinatorial optimization problems in multicast routing
• THE EFFECT OF ASYMMETRY ON THE ON-LINE MULTICAST ROUTING PROBLEM
• Dynamic Steiner Tree Problem
• The Performance of greedy algorithms for the on-line steiner tree and related problems
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A Near-Tight Bound for the Online Steiner Tree Problem in Graphs of Bounded Asymmetry