{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T06:22:41Z","timestamp":1725776561636},"reference-count":25,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013,10]]},"DOI":"10.1109\/focs.2013.66","type":"proceedings-article","created":{"date-parts":[[2014,1,3]],"date-time":"2014-01-03T18:37:15Z","timestamp":1388774235000},"page":"558-567","source":"Crossref","is-referenced-by-count":12,"title":["Online Node-Weighted Steiner Forest and Extensions via Disk Paintings"],"prefix":"10.1109","author":[{"given":"Mohammad Taghi","family":"Hajiaghayi","sequence":"first","affiliation":[]},{"given":"Vahid","family":"Liaghat","sequence":"additional","affiliation":[]},{"given":"Debmalya","family":"Panigrahi","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"19","first-page":"27","article-title":"Matching: A wellsolved class of integer linear programs","author":"edmonds","year":"2001","journal-title":"Combinatorial Optimization"},{"doi-asserted-by":"publisher","key":"17","DOI":"10.1007\/978-3-642-22006-7_4"},{"doi-asserted-by":"publisher","key":"18","DOI":"10.1016\/0166-218X(92)90258-C"},{"doi-asserted-by":"publisher","key":"15","DOI":"10.1137\/S0097539702420474"},{"doi-asserted-by":"publisher","key":"16","DOI":"10.1137\/080729645"},{"doi-asserted-by":"publisher","key":"13","DOI":"10.1007\/978-3-642-31594-7_18"},{"doi-asserted-by":"publisher","key":"14","DOI":"10.1145\/301250.301406"},{"key":"11","first-page":"328","article-title":"Nodeweighted steiner tree and group steiner tree in planar graphs","author":"demaine","year":"2009","journal-title":"ICALP"},{"doi-asserted-by":"publisher","key":"12","DOI":"10.1016\/j.ic.2012.10.017"},{"doi-asserted-by":"publisher","key":"21","DOI":"10.1561\/0400000024"},{"year":"2005","author":"korman","journal-title":"On the Use of Randomization in the Online Set Cover Problem","key":"20"},{"doi-asserted-by":"publisher","key":"22","DOI":"10.1007\/BF01581035"},{"doi-asserted-by":"publisher","key":"23","DOI":"10.1145\/1198513.1198522"},{"doi-asserted-by":"publisher","key":"24","DOI":"10.1007\/BF01364272"},{"doi-asserted-by":"publisher","key":"25","DOI":"10.1007\/BF02579141"},{"doi-asserted-by":"publisher","key":"3","DOI":"10.1145\/258533.258618"},{"doi-asserted-by":"publisher","key":"2","DOI":"10.1016\/j.tcs.2004.05.021"},{"doi-asserted-by":"publisher","key":"10","DOI":"10.1006\/inco.1998.2754"},{"doi-asserted-by":"publisher","key":"1","DOI":"10.1137\/0404033"},{"key":"7","first-page":"210","article-title":"Online nodeweighted steiner tree and related problems","author":"naor","year":"2011","journal-title":"FOCS"},{"doi-asserted-by":"publisher","key":"6","DOI":"10.1137\/060661946"},{"doi-asserted-by":"publisher","key":"5","DOI":"10.1137\/S0097539793242618"},{"doi-asserted-by":"publisher","key":"4","DOI":"10.1137\/S0097539792236237"},{"doi-asserted-by":"publisher","key":"9","DOI":"10.1006\/jagm.1995.1029"},{"doi-asserted-by":"publisher","key":"8","DOI":"10.1006\/jagm.1999.1042"}],"event":{"name":"2013 IEEE 54th Annual Symposium on Foundations of Computer Science (FOCS)","start":{"date-parts":[[2013,10,26]]},"location":"Berkeley, CA, USA","end":{"date-parts":[[2013,10,29]]}},"container-title":["2013 IEEE 54th Annual Symposium on Foundations of Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6685222\/6686124\/06686192.pdf?arnumber=6686192","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,10,14]],"date-time":"2020-10-14T15:48:00Z","timestamp":1602690480000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/6686192"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,10]]},"references-count":25,"URL":"https:\/\/doi.org\/10.1109\/focs.2013.66","relation":{},"subject":[],"published":{"date-parts":[[2013,10]]}}}
