Online Priority Steiner Tree Problems

DOI10.1007/978-3-642-03367-4_4zbMath1253.68367OpenAlexW2147914448MaRDI QIDQ3183439

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) Communication networks in operations research (90B18) Randomized algorithms (68W20) Communication theory (94A05) Online algorithms; streaming algorithms (68W27)

Related Items (4)

Non-greedy online Steiner trees on outerplanar graphs ⋮ Approximation algorithms for priority Steiner tree problems ⋮ Non-greedy Online Steiner Trees on Outerplanar Graphs ⋮ On the separation and equivalence of paging strategies and other online algorithms

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• 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
• A Near-Tight Bound for the Online Steiner Tree Problem in Graphs of Bounded Asymmetry
• Dynamic Steiner Tree Problem
• The Performance of greedy algorithms for the on-line steiner tree and related problems

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