{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T00:46:09Z","timestamp":1743036369415,"version":"3.40.3"},"publisher-location":"Cham","reference-count":26,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319621265"},{"type":"electronic","value":"9783319621272"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"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":[[2017]]},"DOI":"10.1007\/978-3-319-62127-2_19","type":"book-chapter","created":{"date-parts":[[2017,7,4]],"date-time":"2017-07-04T02:47:31Z","timestamp":1499136451000},"page":"217-228","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Relaxing the Irrevocability Requirement for Online Graph Algorithms"],"prefix":"10.1007","author":[{"given":"Joan","family":"Boyar","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lene M.","family":"Favrholdt","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michal","family":"Kotrb\u010d\u00edk","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kim S.","family":"Larsen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,7,5]]},"reference":[{"key":"19_CR1","doi-asserted-by":"crossref","unstructured":"Bartal, Y., Fiat, A., Leonardi, S.: Lower bounds for on-line graph problems with application to on-line circuit and optical routing. In: 28th STOC, pp. 531\u2013540. ACM (1996)","DOI":"10.1145\/237814.238001"},{"key":"19_CR2","unstructured":"Boyar, J., Eidenbenz, S.J., Favrholdt, L.M., Kotrb\u010d\u00edk, M., Larsen, K.S.: Online dominating set. In: 15th SWAT, LIPIcs, vol. 53, pp. 21:1\u201321:15. Schloss Dagstuhl \u2013 Leibniz-Zentrum f\u00fcr Informatik GmbH (2016)"},{"key":"19_CR3","doi-asserted-by":"crossref","unstructured":"Boyar, J., Favrholdt, L.M., Kotrb\u010d\u00edk, M., Larsen, K.S.: Relaxing the irrevocability requirements for online graph algorithms. Technical Report arXiv:1704.08835 [cs.DS], arXiv (2017)","DOI":"10.1007\/978-3-319-62127-2_19"},{"issue":"1","key":"19_CR4","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1007\/s00224-014-9566-4","volume":"58","author":"M Cygan","year":"2016","unstructured":"Cygan, M., Je\u017c, \u0141., Sgall, J.: Online knapsack revisited. Theor. Comput. Syst. 58(1), 153\u2013190 (2016)","journal-title":"Comput. Syst."},{"key":"19_CR5","doi-asserted-by":"crossref","unstructured":"Demange, M., Paschos, V.T.: On-line vertex-covering. Theor. Comput. Sci. 332, 83\u2013108 (2005)","DOI":"10.1016\/j.tcs.2004.08.015"},{"issue":"3","key":"19_CR6","doi-asserted-by":"publisher","first-page":"1251","DOI":"10.1137\/100801901","volume":"25","author":"L Epstein","year":"2011","unstructured":"Epstein, L., Levin, A., Mestre, J., Segev, D.: Improved approximation guarantees for weighted matching in the semi-streaming model. SIAM J. Discrete Math. 25(3), 1251\u20131265 (2011)","journal-title":"SIAM J. Discrete Math."},{"key":"19_CR7","unstructured":"Epstein, L., Levin, A., Segev, D., Weimann, O.: Improved bounds for online preemptive matching. In: 30th STACS, LIPIcs, vol. 20, pp. 389\u2013399. Schloss Dagstuhl \u2013 Leibniz-Zentrum f\u00fcr Informatik GmbH (2013)"},{"issue":"2\u20133","key":"19_CR8","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1016\/j.tcs.2005.09.013","volume":"348","author":"J Feigenbaum","year":"2005","unstructured":"Feigenbaum, J., Kannan, S., McGregor, A., Suri, S., Zhang, J.: On graph problems in a semi-streaming model. Theor. Comput. Sci. 348(2\u20133), 207\u2013216 (2005)","journal-title":"Theor. Comput. Sci."},{"issue":"1","key":"19_CR9","doi-asserted-by":"publisher","first-page":"180","DOI":"10.1006\/jagm.1996.0821","volume":"23","author":"JA Garay","year":"1997","unstructured":"Garay, J.A., Gopal, I.S., Kutten, S., Mansour, Y., Yung, M.: Efficient on-line call control algorithms. J. Algorithm. 23(1), 180\u2013194 (1997)","journal-title":"J. Algorithm."},{"issue":"1","key":"19_CR10","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1137\/140955276","volume":"45","author":"A Gu","year":"2016","unstructured":"Gu, A., Gupta, A., Kumar, A.: The power of deferral: Maintaining a constant-competitive steiner tree online. SIAM J. Comput. 45(1), 1\u201328 (2016)","journal-title":"SIAM J. Comput."},{"key":"19_CR11","doi-asserted-by":"crossref","unstructured":"Gupta, A., Kumar, A.: Online steiner tree with deletions. In: 25th SODA, pp. 455\u2013467 (2014)","DOI":"10.1137\/1.9781611973402.34"},{"key":"19_CR12","doi-asserted-by":"publisher","first-page":"395","DOI":"10.1016\/j.tcs.2014.10.017","volume":"562","author":"X Han","year":"2015","unstructured":"Han, X., Kawase, Y., Makino, K.: Randomized algorithms for online knapsack problems. Theor. Comput. Sci. 562, 395\u2013405 (2015)","journal-title":"Theor. Comput. Sci."},{"key":"19_CR13","doi-asserted-by":"publisher","first-page":"62","DOI":"10.1016\/j.tcs.2013.09.013","volume":"540","author":"X Han","year":"2014","unstructured":"Han, X., Kawase, Y., Makino, K., Guo, H.: Online removable knapsack problem under convex function. Theor. Comput. Sci. 540, 62\u201369 (2014)","journal-title":"Theor. Comput. Sci."},{"key":"19_CR14","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1016\/j.tcs.2015.09.021","volume":"609","author":"X Han","year":"2016","unstructured":"Han, X., Makino, K.: Online minimization knapsack problem. Theor. Comput. Sci. 609, 185\u2013196 (2016)","journal-title":"Theor. Comput. Sci."},{"issue":"3","key":"19_CR15","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."},{"key":"19_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1007\/3-540-45465-9_26","volume-title":"Automata, Languages and Programming","author":"K Iwama","year":"2002","unstructured":"Iwama, K., Taketomi, S.: Removable online knapsack problems. In: Widmayer, P., Eidenbenz, S., Triguero, F., Morales, R., Conejo, R., Hennessy, M. (eds.) ICALP 2002. LNCS, vol. 2380, pp. 293\u2013305. Springer, Heidelberg (2002). doi:10.1007\/3-540-45465-9_26"},{"key":"19_CR17","doi-asserted-by":"publisher","first-page":"84","DOI":"10.1002\/net.21559","volume":"64","author":"P Jaillet","year":"2014","unstructured":"Jaillet, P., Lu, X.: Online traveling salesman problems with rejection options. Networks 64, 84\u201395 (2014)","journal-title":"Networks"},{"key":"19_CR18","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1007\/BF01762111","volume":"3","author":"AR Karlin","year":"1988","unstructured":"Karlin, A.R., Manasse, M.S., Rudolph, L., Sleator, D.D.: Competitive snoopy caching. Algorithmica 3, 79\u2013119 (1988)","journal-title":"Algorithmica"},{"key":"19_CR19","unstructured":"Komm, D., Kr\u00e1lovi\u010d, R., Kr\u00e1lovi\u010d, R., Kudahl, C.: Advice complexity of the online induced subgraph problem. In: 41st MFCS, LIPIcs, vol. 58, pp. 59:1\u201359:13. Schloss Dagstuhl \u2013 Leibniz-Zentrum f\u00fcr Informatik (2016)"},{"key":"19_CR20","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1016\/S0167-5060(08)70322-4","volume":"2","author":"B Korte","year":"1978","unstructured":"Korte, B., Hausmann, D.: An analysis of the greedy heuristic for independence systems. Ann. Discrete Math. 2, 65\u201374 (1978)","journal-title":"Ann. Discrete Math."},{"issue":"3","key":"19_CR21","doi-asserted-by":"publisher","first-page":"859","DOI":"10.1137\/130917703","volume":"45","author":"N Megow","year":"2016","unstructured":"Megow, N., Skutella, M., Verschae, J., Wiese, A.: The power of recourse for online MST and TSP. SIAM J. Comput. 45(3), 859\u2013880 (2016)","journal-title":"SIAM J. Comput."},{"key":"19_CR22","unstructured":"Rawitz, D., Ros\u00e9n, A.: Online budgeted maximum coverage. In: 24th ESA, LIIPCcs, vol. 57, pp. 73:1\u201373:17. Schloss Dagstuhl \u2013 Leibniz-Zentrum f\u00fcr Informatik GmbH (2016)"},{"key":"19_CR23","doi-asserted-by":"crossref","unstructured":"Saha, B., Getoor, L.: On maximum coverage in the streaming model & application to multi-topic blog-watch. In: 9th SDM, pp. 697\u2013708. SIAM (2009)","DOI":"10.1137\/1.9781611972795.60"},{"issue":"2","key":"19_CR24","doi-asserted-by":"publisher","first-page":"202","DOI":"10.1145\/2786.2793","volume":"28","author":"DD Sleator","year":"1985","unstructured":"Sleator, D.D., Tarjan, R.E.: Amortized efficiency of list update and paging rules. Communications of the ACM 28(2), 202\u2013208 (1985)","journal-title":"Communications of the ACM"},{"key":"19_CR25","doi-asserted-by":"crossref","unstructured":"Tarjan, R.E.: Data structures and network algorithms. In: CBMS-NSF Regional Conference Series in Applied Mathematics, vol. 44. SIAM (1983)","DOI":"10.1137\/1.9781611970265"},{"issue":"1","key":"19_CR26","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1145\/1077464.1077472","volume":"1","author":"DED Vinkemeier","year":"2005","unstructured":"Vinkemeier, D.E.D., Hougardy, S.: A linear-time approximation algorithm for weighted matchings in graphs. ACM T. Algorithms 1(1), 107\u2013122 (2005)","journal-title":"ACM T. Algorithms"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Data Structures"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-62127-2_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,7]],"date-time":"2024-03-07T16:16:53Z","timestamp":1709828213000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-62127-2_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319621265","9783319621272"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-62127-2_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]},"assertion":[{"value":"5 July 2017","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WADS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Workshop on Algorithms and Data Structures","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"St. John's","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Canada","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2017","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"31 July 2017","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2 August 2017","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"wads2017","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.wads.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}