{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T13:39:20Z","timestamp":1740145160554,"version":"3.37.3"},"reference-count":10,"publisher":"Springer Science and Business Media LLC","issue":"7","license":[{"start":{"date-parts":[[2017,1,12]],"date-time":"2017-01-12T00:00:00Z","timestamp":1484179200000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100001729","name":"Stiftelsen f\u00f6r Strategisk Forskning","doi-asserted-by":"publisher","award":["IIS11-0089"],"award-info":[{"award-number":["IIS11-0089"]}],"id":[{"id":"10.13039\/501100001729","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Optim Lett"],"published-print":{"date-parts":[[2017,10]]},"DOI":"10.1007\/s11590-017-1108-y","type":"journal-article","created":{"date-parts":[[2017,1,12]],"date-time":"2017-01-12T02:40:43Z","timestamp":1484188843000},"page":"1293-1302","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Calculating approximation guarantees for partial set cover of pairs"],"prefix":"10.1007","volume":"11","author":[{"given":"Peter","family":"Damaschke","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,1,12]]},"reference":[{"key":"1108_CR1","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1287\/moor.4.3.233","volume":"4","author":"V Chvatal","year":"1979","unstructured":"Chvatal, V.: A greedy heuristic for the set-covering problem. Math. Oper. Res. 4, 233\u2013235 (1979)","journal-title":"Math. Oper. Res."},{"key":"1108_CR2","doi-asserted-by":"crossref","first-page":"6","DOI":"10.1145\/2594439","volume":"6","author":"M Cygan","year":"2014","unstructured":"Cygan, M., Kratsch, S., Pilipczuk, M., Pilipczuk, M., Wahlstr\u00f6m, W.: Clique cover and graph separation: new incompressibility results. ACM Trans. Comput. Theory 6, 6 (2014)","journal-title":"ACM Trans. Comput. Theory"},{"key":"1108_CR3","series-title":"LNCS","first-page":"214","volume-title":"FCT 2015","author":"P Damaschke","year":"2015","unstructured":"Damaschke, P.: Pairs covered by a sequence of sets. In: Kosowski, A., Walukiewicz, I. (eds.) FCT 2015. LNCS, vol. 9210, pp. 214\u2013226. Springer, Heidelberg (2015)"},{"key":"1108_CR4","first-page":"110","volume-title":"APPROX-RANDOM 2013, LNCS","author":"K Edwards","year":"2013","unstructured":"Edwards, K., Griffiths, S., Kennedy, W.S.: Partial interval set cover\u2013trade-offs between scalability and optimality. In: Raghavendra, P., Raskhodnikova, S., Jansen, K., Rolim, J.D.P. (eds.) APPROX-RANDOM 2013, LNCS, vol. 8096, pp. 110\u2013125. Springer, Heidelberg (2013)"},{"key":"1108_CR5","series-title":"Essays dedicated to Esko Ukkonen on the occasion of his 60th birthday, LNCS","doi-asserted-by":"crossref","first-page":"102","DOI":"10.1007\/978-3-642-12476-1_7","volume-title":"Algorithms and Applications","author":"T Elomaa","year":"2010","unstructured":"Elomaa, T., Kujala, J.: Covering analysis of the greedy algorithm for partial cover. In: Elomaa, T., Mannila, H., Orponen, P. (eds.) Algorithms and Applications. Essays dedicated to Esko Ukkonen on the occasion of his 60th birthday, LNCS, vol. 6060, pp. 102\u2013113. Springer, Heidelberg (2010)"},{"key":"1108_CR6","doi-asserted-by":"crossref","first-page":"634","DOI":"10.1145\/285055.285059","volume":"45","author":"U Feige","year":"1998","unstructured":"Feige, U.: A threshold of in n for approximating set cover. J. ACM 45, 634\u2013652 (1998)","journal-title":"J. ACM"},{"key":"1108_CR7","first-page":"2","volume":"13","author":"J Gramm","year":"2008","unstructured":"Gramm, J., Guo, J., H\u00fcffner, F., Niedermeier, R.: Data reduction and exact algorithms for clique cover. ACM J. Exper. Algorithmics 13, 2 (2008)","journal-title":"ACM J. Exper. Algorithmics"},{"key":"1108_CR8","doi-asserted-by":"crossref","first-page":"615","DOI":"10.1002\/(SICI)1520-6750(199809)45:6<615::AID-NAV5>3.0.CO;2-5","volume":"45","author":"DS Hochbaum","year":"1998","unstructured":"Hochbaum, D.S., Pathria, A.: Analysis of the greedy approach of maximum k-coverage. Naval Res. Q. 45, 615\u2013627 (1998)","journal-title":"Naval Res. Q."},{"key":"1108_CR9","first-page":"240","volume-title":"WG 2008 LNCS","author":"J Kneis","year":"2008","unstructured":"Kneis, J., Langer, A., Rossmanith, P.: Improved upper bounds for partial vertex cover. In: Broersma, H., Erlebach, T., Friedetzky, T., Paulusma, D. (eds.) WG 2008 LNCS, vol. 5344, pp. 240\u2013251. Springer, Heidelberg (2008)"},{"key":"1108_CR10","series-title":"Oxford lecture series in math. and its appl.","doi-asserted-by":"crossref","DOI":"10.1093\/acprof:oso\/9780198566076.001.0001","volume-title":"Invitation to Fixed-Parameter Algorithms","author":"R Niedermeier","year":"2006","unstructured":"Niedermeier, R.: Invitation to Fixed-Parameter Algorithms. Oxford lecture series in math. and its appl. Oxford University Press, Oxford (2006)"}],"container-title":["Optimization Letters"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11590-017-1108-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-017-1108-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-017-1108-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,9,18]],"date-time":"2017-09-18T03:12:24Z","timestamp":1505704344000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11590-017-1108-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,1,12]]},"references-count":10,"journal-issue":{"issue":"7","published-print":{"date-parts":[[2017,10]]}},"alternative-id":["1108"],"URL":"https:\/\/doi.org\/10.1007\/s11590-017-1108-y","relation":{},"ISSN":["1862-4472","1862-4480"],"issn-type":[{"type":"print","value":"1862-4472"},{"type":"electronic","value":"1862-4480"}],"subject":[],"published":{"date-parts":[[2017,1,12]]}}}