{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T00:36:35Z","timestamp":1743122195533,"version":"3.40.3"},"publisher-location":"Cham","reference-count":17,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319730127"},{"type":"electronic","value":"9783319730134"}],"license":[{"start":{"date-parts":[[2017,12,21]],"date-time":"2017-12-21T00:00:00Z","timestamp":1513814400000},"content-version":"unspecified","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":[[2018]]},"DOI":"10.1007\/978-3-319-73013-4_31","type":"book-chapter","created":{"date-parts":[[2017,12,20]],"date-time":"2017-12-20T19:19:27Z","timestamp":1513797567000},"page":"334-345","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Hitting Set Problem for Axis-Parallel Squares Intersecting a Straight Line Is Polynomially Solvable for Any Fixed Range of Square Sizes"],"prefix":"10.1007","author":[{"given":"Daniel","family":"Khachay","sequence":"first","affiliation":[]},{"given":"Michael","family":"Khachay","sequence":"additional","affiliation":[]},{"given":"Maria","family":"Poberiy","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,12,21]]},"reference":[{"issue":"4","key":"31_CR1","doi-asserted-by":"publisher","first-page":"463","DOI":"10.1007\/BF02570718","volume":"14","author":"H Br\u00f6nnimann","year":"1995","unstructured":"Br\u00f6nnimann, H., Goodrich, M.T.: Almost optimal set covers in finite VC-dimension. Discrete Comput. Geom. 14(4), 463\u2013479 (1995)","journal-title":"Discrete Comput. Geom."},{"issue":"2","key":"31_CR2","doi-asserted-by":"publisher","first-page":"178","DOI":"10.1016\/S0196-6774(02)00294-8","volume":"46","author":"TM Chan","year":"2003","unstructured":"Chan, T.M.: Polynomial-time approximation schemes for packing and piercing fat objects. J. Algorithms 46(2), 178\u2013189 (2003)","journal-title":"J. Algorithms"},{"issue":"9","key":"31_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":"31_CR4","doi-asserted-by":"publisher","first-page":"344","DOI":"10.1007\/s00454-014-9661-y","volume":"53","author":"J Correa","year":"2015","unstructured":"Correa, J., 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":"3","key":"31_CR5","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1016\/0020-0190(81)90111-3","volume":"12","author":"RJ Fowler","year":"1981","unstructured":"Fowler, R.J., Paterson, M.S., Tanimoto, S.L.: Optimal packing and covering in the plane are NP-complete. Inf. Process. Lett. 12(3), 133\u2013137 (1981)","journal-title":"Inf. Process. Lett."},{"issue":"2","key":"31_CR6","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1007\/BF02187876","volume":"2","author":"D Haussler","year":"1987","unstructured":"Haussler, D., Welzl, E.: Epsilon-nets and simplex range queries. Discrete Comput. Geom. 2(2), 127\u2013151 (1987)","journal-title":"Discrete Comput. Geom."},{"issue":"1","key":"31_CR7","doi-asserted-by":"publisher","first-page":"130","DOI":"10.1145\/2455.214106","volume":"32","author":"D Hochbaum","year":"1985","unstructured":"Hochbaum, D., Maass, W.: Approximation schemes for covering and packing problems in image processing and VLSI. J. ACM 32(1), 130\u2013136 (1985)","journal-title":"J. ACM"},{"issue":"1","key":"31_CR8","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1007\/s10994-015-5505-0","volume":"101","author":"M Khachay","year":"2015","unstructured":"Khachay, M.: Committee polyhedral separability: complexity and polynomial approximation. Mach. Learn. 101(1), 231\u2013251 (2015)","journal-title":"Mach. Learn."},{"issue":"2","key":"31_CR9","doi-asserted-by":"crossref","first-page":"217","DOI":"10.15388\/Informatica.2009.247","volume":"20","author":"M Khachay","year":"2009","unstructured":"Khachay, M., Poberii, M.: Complexity and approximability of committee polyhedral separability of sets in general position. Informatica 20(2), 217\u2013234 (2009)","journal-title":"Informatica"},{"issue":"1","key":"31_CR10","first-page":"135","volume":"13","author":"M Khachay","year":"2015","unstructured":"Khachay, M., Pobery, M., Khachay, D.: Integer partition problem: theoretical approach to improving accuracy of classifier ensembles. Int. J. Artif. Intell. 13(1), 135\u2013146 (2015)","journal-title":"Int. J. Artif. Intell."},{"key":"31_CR11","doi-asserted-by":"publisher","first-page":"117","DOI":"10.15826\/umj.2016.2.010","volume":"2","author":"M Khachay","year":"2016","unstructured":"Khachay, M., Khachay, D.: On parameterized complexity of the Hitting Set Problem for axis-parallel squares intersecting a straight line. Ural Math. J. 2, 117\u2013126 (2016)","journal-title":"Ural Math. J."},{"key":"31_CR12","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4613-0039-7","volume-title":"Lectures on Discrete Geometry","author":"J Matou\u0161ek","year":"2002","unstructured":"Matou\u0161ek, J.: Lectures on Discrete Geometry. Springer, New York (2002). https:\/\/doi.org\/10.1007\/978-1-4613-0039-7"},{"key":"31_CR13","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). https:\/\/doi.org\/10.1007\/978-3-319-26626-8_10"},{"key":"31_CR14","unstructured":"Mustafa, N.H., Varadarajan, K.: Epsilon-approximations and epsilon-nets. CoRR, abs\/1702.03676 (2017)"},{"key":"31_CR15","volume-title":"Wireless Sensor Networks: From Theory to Applications","author":"S Ramakrishnan","year":"2014","unstructured":"Ramakrishnan, S., El Emary, I.M.M.: Wireless Sensor Networks: From Theory to Applications. Taylor & Francis, CRC Press, New York (2014)"},{"key":"31_CR16","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/8291.001.0001","volume-title":"Boosting: Foundations and Algorithms","author":"R Schapire","year":"2012","unstructured":"Schapire, R., Freund, Y.: Boosting: Foundations and Algorithms. MIT Press, Cambridge (2012)"},{"key":"31_CR17","doi-asserted-by":"publisher","first-page":"264","DOI":"10.1137\/1116025","volume":"16","author":"V Vapnik","year":"1971","unstructured":"Vapnik, V., Chervonenkis, A.: On the uniform convergence of relative frequencies of events to their probabilities. Theory Probab. Appl. 16, 264\u2013280 (1971)","journal-title":"Theory Probab. Appl."}],"container-title":["Lecture Notes in Computer Science","Analysis of Images, Social Networks and Texts"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-73013-4_31","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,13]],"date-time":"2024-03-13T10:15:01Z","timestamp":1710324901000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-73013-4_31"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,12,21]]},"ISBN":["9783319730127","9783319730134"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-73013-4_31","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017,12,21]]},"assertion":[{"value":"21 December 2017","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"AIST","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Analysis of Images, Social Networks and Texts","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Moscow","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Russia","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2017","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27 July 2017","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 July 2017","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"aist2017","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/aistconf.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}