{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T05:41:09Z","timestamp":1743054069240,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642229527"},{"type":"electronic","value":"9783642229534"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-22953-4_16","type":"book-chapter","created":{"date-parts":[[2011,8,17]],"date-time":"2011-08-17T08:28:08Z","timestamp":1313569688000},"page":"181-192","source":"Crossref","is-referenced-by-count":7,"title":["Online Maximum k-Coverage"],"prefix":"10.1007","author":[{"given":"Giorgio","family":"Ausiello","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nicolas","family":"Boria","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Aristotelis","family":"Giannakos","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Giorgio","family":"Lucarelli","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vangelis Th.","family":"Paschos","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"16_CR1","first-page":"697","volume-title":"DM 2009","author":"B. Saha","year":"2009","unstructured":"Saha, B., Getoor, L.: On maximum coverage in the streaming model & application to multi-topic blog-watch. In: DM 2009, pp. 697\u2013708. SIAM, Philadelphia (2009)"},{"key":"16_CR2","doi-asserted-by":"publisher","first-page":"634","DOI":"10.1145\/285055.285059","volume":"45","author":"U. Feige","year":"1998","unstructured":"Feige, U.: A threshold of ln n for approximating set cover. Journal of the ACM\u00a045, 634\u2013652 (1998)","journal-title":"Journal of the ACM"},{"key":"16_CR3","doi-asserted-by":"publisher","first-page":"615","DOI":"10.1002\/(SICI)1520-6750(199809)45:6<615::AID-NAV5>3.0.CO;2-5","volume":"45","author":"D.S. Hochbaum","year":"1998","unstructured":"Hochbaum, D.S., Pathria, A.: Analysis of the greedy approach in problems of maximum k-coverage. Naval Research Logistics\u00a045, 615\u2013627 (1998)","journal-title":"Naval Research Logistics"},{"key":"16_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1007\/3-540-48777-8_2","volume-title":"Integer Programming and Combinatorial Optimization","author":"A.A. Ageev","year":"1999","unstructured":"Ageev, A.A., Sviridenko, M.I.: Approximation algorithms for maximum coverage and max cut with given sizes of parts. In: Cornu\u00e9jols, G., Burkard, R.E., Woeginger, G.J. (eds.) IPCO 1999. LNCS, vol.\u00a01610, pp. 17\u201330. Springer, Heidelberg (1999)"},{"key":"16_CR5","doi-asserted-by":"publisher","first-page":"174","DOI":"10.1006\/jagm.2001.1183","volume":"41","author":"U. Feige","year":"2001","unstructured":"Feige, U., Langberg, M.: Approximation algorithms for maximization problems arising in graph partitioning. Journal of Algorithms\u00a041, 174\u2013211 (2001)","journal-title":"Journal of Algorithms"},{"key":"16_CR6","doi-asserted-by":"publisher","first-page":"342","DOI":"10.1016\/S0377-2217(02)00330-2","volume":"143","author":"Q. Han","year":"2002","unstructured":"Han, Q., Ye, Y., Zhang, H., Zhang, J.: On approximation of max-vertex-cover. European Journal of Operational Research\u00a0143, 342\u2013355 (2002)","journal-title":"European Journal of Operational Research"},{"key":"16_CR7","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1016\/0166-218X(84)90088-X","volume":"9","author":"D.G. Corneil","year":"1984","unstructured":"Corneil, D.G., Perl, Y.: Clustering and domination in perfect graphs. Discrete Applied Mathematics\u00a09, 27\u201339 (1984)","journal-title":"Discrete Applied Mathematics"},{"key":"16_CR8","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1016\/S0167-6377(02)00122-0","volume":"30","author":"D.J. Rader Jr.","year":"2002","unstructured":"Rader Jr., D.J., Woeginger, G.J.: The quadratic 0-1 knapsack problem with series-parallel support. Operations Research Letters\u00a030, 159\u2013166 (2002)","journal-title":"Operations Research Letters"},{"key":"16_CR9","doi-asserted-by":"crossref","unstructured":"Ausiello, G., Boria, N., Giannakos, A., Lucarelli, G., Paschos, V.T.: Online maximum k-coverage. Technical Report 299, Universit\u00e9 Paris-Dauphine, Cahiers du LAMSADE (2010)","DOI":"10.1007\/978-3-642-22953-4_16"},{"key":"16_CR10","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1145\/254180.254190","volume":"29","author":"V.T. Paschos","year":"1997","unstructured":"Paschos, V.T.: A survey of approximately optimal solutions to some covering and packing problems. ACM Computing Surveys\u00a029, 171\u2013209 (1997)","journal-title":"ACM Computing Surveys"}],"container-title":["Lecture Notes in Computer Science","Fundamentals of Computation Theory"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-22953-4_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T20:10:34Z","timestamp":1558296634000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-22953-4_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642229527","9783642229534"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-22953-4_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}