{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,2]],"date-time":"2025-07-02T11:50:05Z","timestamp":1751457005538,"version":"3.40.3"},"publisher-location":"Cham","reference-count":10,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030398804"},{"type":"electronic","value":"9783030398811"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-39881-1_17","type":"book-chapter","created":{"date-parts":[[2020,1,27]],"date-time":"2020-01-27T03:02:33Z","timestamp":1580094153000},"page":"198-210","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Packing and Covering with Segments"],"prefix":"10.1007","author":[{"given":"Joseph S. B.","family":"Mitchell","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Supantha","family":"Pandit","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,2,20]]},"reference":[{"key":"17_CR1","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1016\/j.comgeo.2019.04.004","volume":"82","author":"S Bandyapadhyay","year":"2019","unstructured":"Bandyapadhyay, S., Maheshwari, A., Mehrabi, S., Suri, S.: Approximating dominating set on intersection graphs of rectangles and L-frames. Comput. Geom. 82, 32\u201344 (2019)","journal-title":"Comput. Geom."},{"issue":"03","key":"17_CR2","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1142\/S0218195912500045","volume":"22","author":"M Berg de","year":"2012","unstructured":"de Berg, M., Khosravi, A.: Optimal binary space partitions for segments in the plane. Int. J. Comput. Geom. Appl. 22(03), 187\u2013205 (2012)","journal-title":"Int. J. Comput. Geom. Appl."},{"issue":"9","key":"17_CR3","doi-asserted-by":"publisher","first-page":"1036","DOI":"10.1016\/j.comgeo.2013.05.008","volume":"46","author":"V Chepoi","year":"2013","unstructured":"Chepoi, V., Felsner, S.: Approximating hitting sets of axis-parallel rectangles intersecting a monotone curve. Comput. Geom. 46(9), 1036\u20131041 (2013)","journal-title":"Comput. Geom."},{"issue":"2","key":"17_CR4","doi-asserted-by":"publisher","first-page":"344","DOI":"10.1007\/s00454-014-9661-y","volume":"53","author":"JR Correa","year":"2015","unstructured":"Correa, J.R., Feuilloley, L., P\u00e9rez-Lantero, P., Soto, J.A.: Independent and hitting sets of rectangles intersecting a diagonal line: algorithms and complexity. Discrete Comput. Geom. 53(2), 344\u2013365 (2015)","journal-title":"Discrete Comput. Geom."},{"issue":"2","key":"17_CR5","doi-asserted-by":"publisher","first-page":"268","DOI":"10.1007\/s00224-016-9744-7","volume":"62","author":"SP Fekete","year":"2018","unstructured":"Fekete, S.P., Huang, K., Mitchell, J.S., Parekh, O., Phillips, C.A.: Geometric hitting set for segments of few orientations. Theory Comput. Syst. 62(2), 268\u2013303 (2018)","journal-title":"Theory Comput. Syst."},{"issue":"2","key":"17_CR6","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1016\/j.comgeo.2004.07.002","volume":"30","author":"MJ Katz","year":"2005","unstructured":"Katz, M.J., Mitchell, J.S.B., Nir, Y.: Orthogonal segment stabbing. Comput. Geom. Theory Appl. 30(2), 197\u2013205 (2005)","journal-title":"Comput. Geom. Theory Appl."},{"key":"17_CR7","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1016\/j.comgeo.2016.05.001","volume":"60","author":"JM Keil","year":"2017","unstructured":"Keil, J.M., Mitchell, J.S.B., Pradhan, D., Vatshelle, M.: An algorithm for the maximum weight independent set problem on outerstring graphs. Comput. Geom. 60, 19\u201325 (2017)","journal-title":"Comput. Geom."},{"key":"17_CR8","volume-title":"Combinatorial Optimization: Networks and Matroids","author":"EL Lawler","year":"2001","unstructured":"Lawler, E.L.: Combinatorial Optimization: Networks and Matroids. Dover, New York (2001)"},{"key":"17_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"126","DOI":"10.1007\/978-3-319-26626-8_10","volume-title":"Combinatorial Optimization and Applications","author":"A Mudgal","year":"2015","unstructured":"Mudgal, A., Pandit, S.: Covering, hitting, piercing and packing rectangles intersecting an inclined line. In: Lu, Z., Kim, D., Wu, W., Li, W., Du, D.-Z. (eds.) COCOA 2015. LNCS, vol. 9486, pp. 126\u2013137. Springer, Cham (2015). \nhttps:\/\/doi.org\/10.1007\/978-3-319-26626-8_10"},{"unstructured":"Pandit, S.: Dominating set of rectangles intersecting a straight line. In: Canadian Conference on Computational Geometry, CCCG, pp. 144\u2013149 (2017)","key":"17_CR10"}],"container-title":["Lecture Notes in Computer Science","WALCOM: Algorithms and Computation"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-39881-1_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,2,19]],"date-time":"2020-02-19T19:05:30Z","timestamp":1582139130000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-39881-1_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030398804","9783030398811"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-39881-1_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"20 February 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WALCOM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Algorithms and Computation","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Singapore","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Singapore","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"31 March 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2 April 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"walcom2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.comp.nus.edu.sg\/~walcom20\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}