Near-Optimal Online Algorithms for Prize-Collecting Steiner Problems

DOI10.1007/978-3-662-43948-7_48zbMath1412.68299OpenAlexW2271728747MaRDI QIDQ5167774

Debmalya Panigrahi, Vahid Liaghat, Mohammad Taghi Hajiaghayi

Publication date: 1 July 2014

Published in: Automata, Languages, and Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-662-43948-7_48

Mathematics Subject Classification ID

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

Related Items (7)

Tight bounds for online weighted tree augmentation ⋮ Online Buy-at-Bulk Network Design ⋮ Timing matters: online dynamics in broadcast games ⋮ Unnamed Item ⋮ Online constrained forest and prize-collecting network design ⋮ Leasing with Uncertainty ⋮ Tight Bounds for Online Weighted Tree Augmentation

This page was built for publication: Near-Optimal Online Algorithms for Prize-Collecting Steiner Problems