{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T17:54:55Z","timestamp":1725558895097},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540243021"},{"type":"electronic","value":"9783540305774"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/978-3-540-30577-4_9","type":"book-chapter","created":{"date-parts":[[2010,7,4]],"date-time":"2010-07-04T15:48:39Z","timestamp":1278258519000},"page":"62-71","source":"Crossref","is-referenced-by-count":0,"title":["Greedy Differential Approximations for Min Set Cover"],"prefix":"10.1007","author":[{"given":"C.","family":"Bazgan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J.","family":"Monnot","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"V. Th.","family":"Paschos","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"F.","family":"Serri\u00e8re","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"9_CR1","series-title":"Lecture Notes in Computer Science","volume-title":"Automata, Languages and Programming","author":"G. Ausiello","year":"1977","unstructured":"Ausiello, G., D\u2019Atri, A., Protasi, M.: On the structure of combinatorial problems and structure preserving reductions. In: Salomaa, A., Steinby, M. (eds.) ICALP 1977. LNCS, vol.\u00a052. Springer, Heidelberg (1977)"},{"key":"9_CR2","doi-asserted-by":"publisher","first-page":"136","DOI":"10.1016\/0022-0000(80)90046-X","volume":"21","author":"G. Ausiello","year":"1980","unstructured":"Ausiello, G., D\u2019Atri, A., Protasi, M.: Structure preserving reductions among convex optimization problems. J.\u00a0Comput. System Sci.\u00a021, 136\u2013153 (1980)","journal-title":"J.\u00a0Comput. System Sci."},{"key":"9_CR3","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1287\/moor.6.3.319","volume":"6","author":"E. Zemel","year":"1981","unstructured":"Zemel, E.: Measuring the quality of approximate solutions to zero-one programming problems. Math. Oper. Res.\u00a06, 319\u2013332 (1981)","journal-title":"Math. Oper. Res."},{"key":"9_CR4","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1016\/0304-3975(95)00060-7","volume":"158","author":"M. Demange","year":"1996","unstructured":"Demange, M., Paschos, V.T.: On an approximation measure founded on the links between optimization and polynomial approximation theory. Theoret. Comput. Sci.\u00a0158, 117\u2013141 (1996)","journal-title":"Theoret. Comput. Sci."},{"key":"9_CR5","doi-asserted-by":"publisher","first-page":"256","DOI":"10.1016\/S0022-0000(74)80044-9","volume":"9","author":"D.S. Johnson","year":"1974","unstructured":"Johnson, D.S.: Approximation algorithms for combinatorial problems. J.\u00a0Comput. System Sci.\u00a09, 256\u2013278 (1974)","journal-title":"J.\u00a0Comput. System Sci."},{"key":"9_CR6","doi-asserted-by":"publisher","first-page":"383","DOI":"10.1016\/0012-365X(75)90058-8","volume":"13","author":"L. Lov\u00e1sz","year":"1975","unstructured":"Lov\u00e1sz, L.: On the ratio of optimal integral and fractional covers. Discrete Math.\u00a013, 383\u2013390 (1975)","journal-title":"Discrete Math."},{"key":"9_CR7","doi-asserted-by":"crossref","unstructured":"Slav\u00edk, P.: A tight analysis of the greedy algorithm for set cover. In: Proc. STOC 1996, pp. 435\u2013441 (1996)","DOI":"10.1145\/237814.237991"},{"key":"9_CR8","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1016\/S0304-3975(97)00099-6","volume":"209","author":"M. Demange","year":"1998","unstructured":"Demange, M., Grisoni, P., Paschos, V.T.: Differential approximation algorithms for some combinatorial optimization problems. Theoret. Comput. Sci.\u00a0209, 107\u2013122 (1998)","journal-title":"Theoret. Comput. Sci."},{"key":"9_CR9","doi-asserted-by":"publisher","first-page":"429","DOI":"10.1006\/jagm.2001.1187","volume":"41","author":"R. Hassin","year":"2001","unstructured":"Hassin, R., Khuller, S.: z-approximations. J.\u00a0Algorithms\u00a041, 429\u2013442 (2001)","journal-title":"J.\u00a0Algorithms"},{"key":"9_CR10","series-title":"Combinatorial optimization problems and their approximability properties","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-58412-1","volume-title":"Complexity and approximation","author":"G. Ausiello","year":"1999","unstructured":"Ausiello, G., Crescenzi, P., Gambosi, G., Kann, V., Marchetti-Spaccamela, A., Protasi, M.: Complexity and approximation. Combinatorial optimization problems and their approximability properties. Springer, Berlin (1999)"}],"container-title":["Lecture Notes in Computer Science","SOFSEM 2005: Theory and Practice of Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-30577-4_9.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,18]],"date-time":"2020-11-18T23:24:08Z","timestamp":1605741848000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-30577-4_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540243021","9783540305774"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-30577-4_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}