{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T00:11:12Z","timestamp":1725495072664},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540429852"},{"type":"electronic","value":"9783540456780"}],"license":[{"start":{"date-parts":[[2001,1,1]],"date-time":"2001-01-01T00:00:00Z","timestamp":978307200000},"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":[[2001]]},"DOI":"10.1007\/3-540-45678-3_42","type":"book-chapter","created":{"date-parts":[[2007,11,15]],"date-time":"2007-11-15T11:12:14Z","timestamp":1195125134000},"page":"493-501","source":"Crossref","is-referenced-by-count":2,"title":["Approximation of a Geometric Set Covering Problem"],"prefix":"10.1007","author":[{"given":"Sofia","family":"Kovaleva","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Frits C. R.","family":"Spieksma","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2001,12,4]]},"reference":[{"key":"42_CR1","doi-asserted-by":"crossref","unstructured":"Arora, S., C. Lund, R. Motwani, M. Sudan, and M. Szegedy (1992), \u2018Proof verification and hardness of approximation problems\u201d, Proceedings of the 33rd IEEE Symposium on the Foundations of Computer Science, 14\u201323.","DOI":"10.1109\/SFCS.1992.267823"},{"key":"42_CR2","doi-asserted-by":"crossref","unstructured":"Bar-Noy, A., S. Gupta, J. Naor and B. Schieber (1999), \u201cApproximating the Throughput of Multiple Machines in Real-Time Scheduling\u201d, Proceedings of the 31st ACM Symposium on Theory of Computing.","DOI":"10.1145\/301250.301420"},{"key":"42_CR3","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/BF02523685","volume":"18","author":"N. Garg","year":"1997","unstructured":"Garg, N., V. V. Vazirani and M. Yannakakis (1997), \u201cPrimal-Dual Approximation Algorithms for Integral Flow and Multicut in Trees\u201d, Algorithmica 18, 3\u201320.","journal-title":"Algorithmica"},{"key":"42_CR4","volume-title":"Algorithmic Graph Theory and Perfect Graphs","author":"M.C. Golumbic","year":"1980","unstructured":"Golumbic, M.C, Algorithmic Graph Theory and Perfect Graphs, Academic Press, San Diego, California, 1980."},{"key":"42_CR5","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1007\/BFb0053967","volume-title":"Instant Recognition of Half Integrality and 2-Approximations","author":"D. S. Hochbaum","year":"1998","unstructured":"Hochbaum, D. S. (1998), \u201cInstant Recognition of Half Integrality and 2-Approximations\u201d, in: Proceedings of the APPROX\u201998 Conference, editors: Klaus Jansen and Jos\u00e9 Rolim, Lecture Notes in Computer Science 1444, 99\u2013110."},{"key":"42_CR6","unstructured":"Schrijver, A., Theory of Linear and Integer Programming, John Wiley & Sons, 1998."},{"key":"42_CR7","doi-asserted-by":"crossref","unstructured":"Aerts, J., Marinissen, E. J. (1998), \u201cScan chain design for test time reduction in core-based ICs\u201d, Paper 18.1 at International test conference, Washington, D. C., October 1998.","DOI":"10.1109\/TEST.1998.743185"},{"key":"42_CR8","unstructured":"Kovaleva, S., Spieksma, F. C. R. (2001), \u201cPrimal-dual approximation algorithms for a packing-covering pair of problems\u201d, Report M 01-01, Department of Mathematics, Maastricht University, P. O.Box 616, NL-6200 MD, Maastricht, The Netherlands."},{"key":"42_CR9","doi-asserted-by":"crossref","unstructured":"Ausiello, G., Crescenzi, P., Gambosi, G., Kann, V., Marchetti-Spaccamela, A., Protasi, M., Complexity and Approximation, Springer-Verlag, Berlin, 1999.","DOI":"10.1007\/978-3-642-58412-1"},{"key":"42_CR10","unstructured":"Nemhauser, G. L., Wolsey, L. A., Integer and Combinatorial Optimization, Wiley & Sons, 1999."},{"key":"42_CR11","doi-asserted-by":"publisher","first-page":"721","DOI":"10.1137\/0606070","volume":"6","author":"A. J. Hoffman","year":"1985","unstructured":"Hoffman, A. J., Kolen, A. W. J., Sakarovitch, M., (1985), \u201cTotally-balanced and greedy matrices\u201d, SIAM Journal of Algebraic and Discrete Methods 6, 721\u2013730.","journal-title":"SIAM Journal of Algebraic and Discrete Methods"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45678-3_42","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,25]],"date-time":"2019-02-25T10:26:16Z","timestamp":1551090376000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45678-3_42"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540429852","9783540456780"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/3-540-45678-3_42","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2001]]}}}