Optimal Competitiveness for Symmetric Rectilinear Steiner Arborescence and Related Problems
From MaRDI portal
Publication:5167866
DOI10.1007/978-3-662-43951-7_44zbMath1411.68083arXiv1307.3080MaRDI QIDQ5167866
Publication date: 1 July 2014
Published in: Automata, Languages, and Programming (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1307.3080
68Q25: Analysis of algorithms and problem complexity
68R10: Graph theory (including graph drawing) in computer science
68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)
68W20: Randomized algorithms
68W27: Online algorithms; streaming algorithms
Related Items
Growing Half-Balls: Minimizing Storage and Communication Costs in Content Delivery Networks, Optimal Competitiveness for the Rectilinear Steiner Arborescence Problem
