Optimal Competitiveness for Symmetric Rectilinear Steiner Arborescence and Related Problems

DOI10.1007/978-3-662-43951-7_44zbMath1411.68083arXiv1307.3080OpenAlexW1665378928MaRDI QIDQ5167866

Shay Kutten, Erez Kantor

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

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Randomized algorithms (68W20) Online algorithms; streaming algorithms (68W27)

Related Items (2)

Optimal Competitiveness for the Rectilinear Steiner Arborescence Problem ⋮ Growing Half-Balls: Minimizing Storage and Communication Costs in Content Delivery Networks

This page was built for publication: Optimal Competitiveness for Symmetric Rectilinear Steiner Arborescence and Related Problems