Non-greedy Online Steiner Trees on Outerplanar Graphs

DOI10.1007/978-3-319-51741-4_11zbMath1484.68342OpenAlexW2568245157MaRDI QIDQ2971163

Akira Matsubayashi

Publication date: 4 April 2017

Published in: Approximation and Online Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-51741-4_11

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Online algorithms; streaming algorithms (68W27)

Cites Work

• Unnamed Item
• Unnamed Item
• On-line Steiner trees in the Euclidean plane
• Cuts, trees and \(\ell_1\)-embeddings of graphs
• Competitive algorithms for distributed data management.
• Competitive distributed file allocation.
• On-line generalized Steiner problem
• Online Priority Steiner Tree Problems
• On the Competitiveness of the Online Asymmetric and Euclidean Steiner Tree Problems
• Dynamic Steiner Tree Problem
• Competitive On-Line Algorithms for Distributed Data Management
• The Performance of greedy algorithms for the on-line steiner tree and related problems
• Embedding k-Outerplanar Graphs into l1
• Online Node-Weighted Steiner Tree and Related Problems