{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,4,4]],"date-time":"2023-04-04T12:54:27Z","timestamp":1680612867535},"reference-count":9,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2008,6,17]],"date-time":"2008-06-17T00:00:00Z","timestamp":1213660800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Cent Eur J Oper Res"],"published-print":{"date-parts":[[2008,12]]},"DOI":"10.1007\/s10100-008-0067-x","type":"journal-article","created":{"date-parts":[[2008,6,16]],"date-time":"2008-06-16T02:15:04Z","timestamp":1213582504000},"page":"407-414","source":"Crossref","is-referenced-by-count":2,"title":["An application of the greedy heuristic of set cover to traffic checks"],"prefix":"10.1007","volume":"16","author":[{"given":"P\u00e1l","family":"Pusztai","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2008,6,17]]},"reference":[{"issue":"3","key":"67_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 (1979) A greedy heuristic for the set-covering problem. Math Oper Res 4(3): 233\u2013235","journal-title":"Math Oper Res"},{"key":"67_CR2","volume-title":"Introduction to algorithms","author":"TH Cormen","year":"2001","unstructured":"Cormen TH, Leiserson CE, Rivest RL (2001) Introduction to algorithms, 2nd edn. McGraw-Hill Book Company, Boston, Mass","edition":"2"},{"issue":"4","key":"67_CR3","doi-asserted-by":"crossref","first-page":"634","DOI":"10.1145\/285055.285059","volume":"45","author":"U Feige","year":"1998","unstructured":"Feige U (1998) A threshold of ln n approximating set cover. J ACM 45(4): 634\u2013652","journal-title":"J ACM"},{"key":"67_CR4","volume-title":"Approximation algorithms for NP-hard problems","year":"1997","unstructured":"Hochbaum, D (ed) (1997) Approximation algorithms for NP-hard problems. PWS Publishing Company, Boston"},{"key":"67_CR5","doi-asserted-by":"crossref","first-page":"256","DOI":"10.1016\/S0022-0000(74)80044-9","volume":"9","author":"DB Johnson","year":"1974","unstructured":"Johnson DB (1974) Approximation algorithms for combinatorial problems. J Comput Syst Sci 9: 256\u2013278","journal-title":"J Comput Syst Sci"},{"key":"67_CR6","doi-asserted-by":"crossref","first-page":"383","DOI":"10.1016\/0012-365X(75)90058-8","volume":"13","author":"L Lov\u00e1sz","year":"1975","unstructured":"Lov\u00e1sz L (1975) On the ratio of optimal integral and fractional covers. Discrete Math 13: 383\u2013390","journal-title":"Discrete Math"},{"issue":"5","key":"67_CR7","doi-asserted-by":"crossref","first-page":"960","DOI":"10.1145\/185675.306789","volume":"41","author":"C Lund","year":"1994","unstructured":"Lund C, Yannakakis M (1994) On the hardness of approximating minimization problems. J ACM 41(5): 960\u2013981","journal-title":"J ACM"},{"key":"67_CR8","unstructured":"Marton L (2000) A label-setting algorithm for calculating shortest path trees in sparse networks. Hung Electron J Sci. Available at http:\/\/heja.szif.hu\/ANM\/ANM-030323-A\/anm030323a.pdf Hungarian: Egy c\u00edmk\u00e9z\u0151 elj\u00e1r\u00e1s a legr\u00f6videbb utak f\u00e1j\u00e1nak meghat\u00e1roz\u00e1s\u00e1ra ritka h\u00e1l\u00f3zatokban, Alk. Mat. Lapok, 19, pp 115\u2013132"},{"key":"67_CR9","unstructured":"Marton L, Pusztai P (2000) On molling and computing traffic assignment. EURO XVII. European Conference on Operational Research, Budapest, Hungary, Proc. p 114"}],"container-title":["Central European Journal of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10100-008-0067-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10100-008-0067-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10100-008-0067-x","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T05:49:26Z","timestamp":1559108966000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10100-008-0067-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,6,17]]},"references-count":9,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2008,12]]}},"alternative-id":["67"],"URL":"https:\/\/doi.org\/10.1007\/s10100-008-0067-x","relation":{},"ISSN":["1435-246X","1613-9178"],"issn-type":[{"value":"1435-246X","type":"print"},{"value":"1613-9178","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008,6,17]]}}}