{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T19:58:29Z","timestamp":1725566309663},"publisher-location":"Berlin, Heidelberg","reference-count":6,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540230250"},{"type":"electronic","value":"9783540301400"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-30140-0_39","type":"book-chapter","created":{"date-parts":[[2010,9,19]],"date-time":"2010-09-19T01:31:13Z","timestamp":1284859873000},"page":"426-435","source":"Crossref","is-referenced-by-count":2,"title":["Approximation of Rectangle Stabbing and Interval Stabbing Problems"],"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","reference":[{"key":"39_CR1","volume-title":"Network Flows: Theory, Algorithms, and Applications","author":"R.K. Ahuja","year":"1993","unstructured":"Ahuja, R.K., Magnanti, T.L., Orlin, J.B.: Network Flows: Theory, Algorithms, and Applications. Prentice-Hall, Englewood Cliffs (1993)"},{"key":"39_CR2","doi-asserted-by":"publisher","first-page":"138","DOI":"10.1006\/jagm.2002.1221","volume":"43","author":"D. Gaur","year":"2002","unstructured":"Gaur, D., Ibaraki, T., Krishnamurti, R.: Constant ratio approximation algorithms for the rectangle stabbing problem and the rectilinear partitioning problem. Journal of Algorithms\u00a043, 138\u2013152 (2002)","journal-title":"Journal of Algorithms"},{"key":"39_CR3","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1016\/0166-218X(91)90011-K","volume":"30","author":"R. Hassin","year":"1991","unstructured":"Hassin, R., Megiddo, N.: Approximation algorithm for hitting objects with straight lines. Discrete Applied Mathematics\u00a030, 29\u201342 (1991)","journal-title":"Discrete Applied Mathematics"},{"key":"39_CR4","unstructured":"Kovaleva, S.: Approximation of Geometric Set Packing and Hitting Set Problems, Ph.D. thesis of Maastricht University (2003)"},{"key":"39_CR5","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1051\/ro:2002005","volume":"36","author":"S. Kovaleva","year":"2002","unstructured":"Kovaleva, S., Spieksma, F.C.R.: Primal-dual approximation algorithms for a packing-covering pair of problems. RAIRO-Operations Research\u00a036, 53\u201372 (2002)","journal-title":"RAIRO-Operations Research"},{"key":"39_CR6","volume-title":"Approximation Algorithms","author":"V.V. Vazirani","year":"2001","unstructured":"Vazirani, V.V.: Approximation Algorithms. Springer, Heidelberg (2001)"}],"container-title":["Lecture Notes in Computer Science","Algorithms \u2013 ESA 2004"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-30140-0_39.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,3]],"date-time":"2021-05-03T03:52:10Z","timestamp":1620013930000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-30140-0_39"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540230250","9783540301400"],"references-count":6,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-30140-0_39","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}