Years and Authors of Summarized Original Work
2011; Naor, Panigrahi, Singh
2013; Hajiaghayi, Liaghat, Panigrahi
2014; Hajiaghayi, Liaghat, Panigrahi
Problem Definition
We are given an undirected graph G = (V, E) offline, where node v has a given weight w v . Initially, the output graph H ⊆ G is the empty graph. In the generic online Steiner network design problem, each online step has a connectivity request C i and the online algorithm must augment the output graph H to meet the new request. We will consider the following problems in this domain:
Steiner tree. Each connectivity request C i comprises a new vertex t i ∈ V (called a terminal) that must be connected in H to all previous terminals. (The first terminal t0 is often called the root and the constraint C i can then be restated as connecting terminal t i to the root.)
Steiner forest. Each connectivity request C i comprises a new vertex pair (s i , t i ) (called a terminal pair) that must be connected in H.
Group Steiner tree....
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Recommended Reading
Alon N, Awerbuch B, Azar Y, Buchbinder N, Naor J (2009) The online set cover problem. SIAM J Comput 39(2):361–370
Demaine ED, Hajiaghayi MT, Klein PN (2009) Node-weighted steiner tree and group steiner tree in planar graphs. In: ICALP (1), Rhodes, pp 328–340
Goemans MX, Williamson DP (1995) A general approximation technique for constrained forest problems. SIAM J Comput 24(2):296–317
Hajiaghayi MT, Liaghat V, Panigrahi D (2013) Online node-weighted steiner forest and extensions via disk paintings. In: FOCS, Berkeley, pp 558–567
Hajiaghayi MT, Liaghat V, Panigrahi D (2014) Near-optimal online algorithms for prize-collecting steiner problems. In: ICALP (1), Copenhagen, pp 576–587
Korman S (2005) On the use of randomization in the online set cover problem. M.S. thesis, Weizmann Institute of Science
Naor J, Panigrahi D, Singh M (2011) Online node-weighted steiner tree and related problems. In: FOCS, Palm Springs, pp 210–219
Qian J, Williamson DP (2011) An O(logn)-competitive algorithm for online constrained forest problems. In: ICALP (1), Zurich, pp 37–48
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2016 Springer Science+Business Media New York
About this entry
Cite this entry
Panigrahi, D. (2016). Online Node-Weighted Problems. In: Kao, MY. (eds) Encyclopedia of Algorithms. Springer, New York, NY. https://doi.org/10.1007/978-1-4939-2864-4_761
Download citation
DOI: https://doi.org/10.1007/978-1-4939-2864-4_761
Published:
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4939-2863-7
Online ISBN: 978-1-4939-2864-4
eBook Packages: Computer ScienceReference Module Computer Science and Engineering