The Power of Recourse for Online MST and TSP
From MaRDI portal
Publication:5891122
DOI10.1007/978-3-642-31594-7_58zbMath1272.68472OpenAlexW1864228528WikidataQ57399763 ScholiaQ57399763MaRDI QIDQ5891122
Andreas Wiese, Nicole Megow, José Verschae
Publication date: 12 August 2013
Published in: Automata, Languages, and Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-31594-7_58
Programming involving graphs or networks (90C35) Combinatorial optimization (90C27) Online algorithms; streaming algorithms (68W27)
Related Items (6)
Simultaneously load balancing for every p-norm, with reassignments ⋮ The Power of Deferral: Maintaining a Constant-Competitive Steiner Tree Online ⋮ Serve or skip: the power of rejection in online bottleneck matching ⋮ A Local-Search Algorithm for Steiner Forest ⋮ Online constrained forest and prize-collecting network design ⋮ The Power of Recourse for Online MST and TSP
This page was built for publication: The Power of Recourse for Online MST and TSP
