{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,9]],"date-time":"2025-04-09T12:34:49Z","timestamp":1744202089551},"publisher-location":"Cham","reference-count":15,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319946665"},{"type":"electronic","value":"9783319946672"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-319-94667-2_18","type":"book-chapter","created":{"date-parts":[[2018,7,3]],"date-time":"2018-07-03T03:56:24Z","timestamp":1530590184000},"page":"214-223","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["An Optimal Algorithm for Online Prize-Collecting Node-Weighted Steiner Forest"],"prefix":"10.1007","author":[{"given":"Christine","family":"Markarian","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,7,4]]},"reference":[{"key":"18_CR1","doi-asserted-by":"crossref","unstructured":"Alon, N., Awerbuch, B., Azar, Y.: The online set cover problem. In: Proceedings of the Thirty-Fifth Annual ACM Symposium on Theory of Computing, STOC 2003, pp. 100\u2013105. ACM, New York (2003)","DOI":"10.1145\/780542.780558"},{"issue":"4","key":"18_CR2","doi-asserted-by":"publisher","first-page":"640","DOI":"10.1145\/1198513.1198522","volume":"2","author":"N Alon","year":"2006","unstructured":"Alon, N., Awerbuch, B., Azar, Y., Buchbinder, N., (Seffi) Naor, J.: A general approach to online network optimization problems. ACM Trans. Algorithms 2(4), 640\u2013660 (2006)","journal-title":"ACM Trans. Algorithms"},{"key":"18_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"208","DOI":"10.1007\/11785293_21","volume-title":"Algorithm Theory \u2013 SWAT 2006","author":"S Angelopoulos","year":"2006","unstructured":"Angelopoulos, S.: The node-weighted steiner problem in graphs of restricted node weights. In: Arge, L., Freivalds, R. (eds.) SWAT 2006. LNCS, vol. 4059, pp. 208\u2013219. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11785293_21"},{"issue":"2\u20133","key":"18_CR4","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1016\/j.tcs.2004.05.021","volume":"324","author":"B Awerbuch","year":"2004","unstructured":"Awerbuch, B., Azar, Y., Bartal, Y.: Online generalized Steiner problem. Theor. Comput. Sci. 324(2\u20133), 313\u2013324 (2004)","journal-title":"Theor. Comput. Sci."},{"key":"18_CR5","doi-asserted-by":"crossref","unstructured":"Berman, P., Coulston, C.: Online algorithms for Steiner tree problems (extended abstract). In: Proceedings of the Twenty-Ninth Annual ACM Symposium on the Theory of Computing, El Paso, Texas, USA, 4\u20136 May 1997, pp. 344\u2013353 (1997)","DOI":"10.1145\/258533.258618"},{"key":"18_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1007\/978-3-319-62127-2_15","volume-title":"Algorithms and Data Structures","author":"M Bienkowski","year":"2017","unstructured":"Bienkowski, M., Kraska, A., Schmidt, P.: A deterministic algorithm for online steiner tree leasing. Algorithms and Data Structures. LNCS, vol. 10389, pp. 169\u2013180. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-62127-2_15"},{"key":"18_CR7","doi-asserted-by":"crossref","unstructured":"Hajiaghayi, M.T., Liaghat, V., Panigrahi, D.: Online node-weighted Steiner forest and extensions via disk paintings. In: 54th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2013, Berkeley, CA, USA, 26\u201329 October 2013, pp. 558\u2013567 (2013)","DOI":"10.1109\/FOCS.2013.66"},{"key":"18_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"576","DOI":"10.1007\/978-3-662-43948-7_48","volume-title":"Automata, Languages, and Programming","author":"MT Hajiaghayi","year":"2014","unstructured":"Hajiaghayi, M.T., Liaghat, V., Panigrahi, D.: Near-optimal online algorithms for prize-collecting Steiner problems. In: Esparza, J., Fraigniaud, P., Husfeldt, T., Koutsoupias, E. (eds.) ICALP 2014. LNCS, vol. 8572, pp. 576\u2013587. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-662-43948-7_48"},{"issue":"3","key":"18_CR9","doi-asserted-by":"publisher","first-page":"369","DOI":"10.1137\/0404033","volume":"4","author":"M Imase","year":"1991","unstructured":"Imase, M., Waxman, B.M.: Dynamic Steiner tree problem. SIAM J. Discrete Math. 4(3), 369\u2013384 (1991)","journal-title":"SIAM J. Discrete Math."},{"issue":"1","key":"18_CR10","doi-asserted-by":"publisher","first-page":"104","DOI":"10.1006\/jagm.1995.1029","volume":"19","author":"P Klein","year":"1995","unstructured":"Klein, P., Ravi, R.: A nearly best-possible approximation algorithm for node-weighted Steiner trees. J. Algorithms 19(1), 104\u2013115 (1995)","journal-title":"J. Algorithms"},{"key":"18_CR11","unstructured":"Korman, S.: On the use of randomization in the online set cover problem. Master\u2019s thesis, Weizmann Institute of Science, Israel (2005)"},{"key":"18_CR12","doi-asserted-by":"crossref","unstructured":"Meyerson, A.: The parking permit problem. In: Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2005), Pittsburgh, PA, USA, 23\u201325 October 2005, pp. 274\u2013284 (2005)","DOI":"10.1109\/SFCS.2005.72"},{"key":"18_CR13","doi-asserted-by":"crossref","unstructured":"(Seffi) Naor, J., Panigrahi, D., Singh, M.: Online node-weighted Steiner tree and related problems. In: Proceedings of the 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science, FOCS 2011, Washington, DC, USA. IEEE Computer Society, pp. 210\u2013219 (2011)","DOI":"10.1109\/FOCS.2011.65"},{"key":"18_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1007\/978-3-642-22006-7_4","volume-title":"Automata, Languages and Programming","author":"J Qian","year":"2011","unstructured":"Qian, J., Williamson, D.P.: An O(logn)-competitive algorithm for online constrained forest problems. In: Aceto, L., Henzinger, M., Sgall, J. (eds.) ICALP 2011. LNCS, vol. 6755, pp. 37\u201348. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-22006-7_4"},{"key":"18_CR15","unstructured":"Schroeder, J., Guedes, A., Duarte Jr., E.P.: Computing the minimum cut and maximum flow of undirected graphs. Technical report, Department of Informatics, Federal University of Paran\u00e1 (2004)"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Algorithms"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-94667-2_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,20]],"date-time":"2019-10-20T04:09:02Z","timestamp":1571544542000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-94667-2_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319946665","9783319946672"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-94667-2_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]}}}