Online Priority Steiner Tree Problems

DOI10.1007/978-3-642-03367-4_4MaRDI QIDQ3183439zbMATH OpenOpenAlexFDO

Authors Spyros Angelopoulos

Publication date 20 October 2009

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-03367-4_4

Mathematics Subject Classification ID

Applications of graph theory (05C90) Randomized algorithms (68W20) Online algorithms; streaming algorithms (68W27) Communication networks in operations research (90B18) Communication theory (94A05)

Recommendations

• Parameterized analysis of the online priority and node-weighted Steiner tree problems
• A Near-Tight Bound for the Online Steiner Tree Problem in Graphs of Bounded Asymmetry
• scientific article; zbMATH DE number 6381651
• The Performance of greedy algorithms for the on-line steiner tree and related problems
• Near-optimal online algorithms for prize-collecting Steiner problems

Cites work

• A Near-Tight Bound for the Online Steiner Tree Problem in Graphs of Bounded Asymmetry
• A survey of combinatorial optimization problems in multicast routing
• Dynamic Steiner Tree Problem
• scientific article; zbMATH DE number 6381651 (Why is no real title available?)
• scientific article; zbMATH DE number 1232130 (Why is no real title available?)
• scientific article; zbMATH DE number 1559550 (Why is no real title available?)
• scientific article; zbMATH DE number 6469194 (Why is no real title available?)
• Linear bounds for on-line Steiner problems
• On the approximability of some network design problems
• On-line generalized Steiner problem
• On-line Steiner trees in the Euclidean plane
• THE EFFECT OF ASYMMETRY ON THE ON-LINE MULTICAST ROUTING PROBLEM
• The Performance of greedy algorithms for the on-line steiner tree and related problems

Cited in

(9)

• An online algorithm for the dynamic maximal dense tree problem
• On-line generalized Steiner problem
• Parameterized analysis of the online priority and node-weighted Steiner tree problems
• Non-greedy online Steiner trees on outerplanar graphs
• Approximation algorithms for priority Steiner tree problems
• Non-greedy online Steiner trees on outerplanar graphs
• A Near-Tight Bound for the Online Steiner Tree Problem in Graphs of Bounded Asymmetry
• The bursty Steiner tree problem
• On the separation and equivalence of paging strategies and other online algorithms

This page was built for publication: Online Priority Steiner Tree Problems

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