{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T07:08:51Z","timestamp":1743059331278,"version":"3.40.3"},"publisher-location":"Cham","reference-count":20,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031498145"},{"type":"electronic","value":"9783031498152"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023]]},"DOI":"10.1007\/978-3-031-49815-2_12","type":"book-chapter","created":{"date-parts":[[2023,12,21]],"date-time":"2023-12-21T07:02:28Z","timestamp":1703142148000},"page":"160-174","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Hitting Sets when the\u00a0Shallow Cell Complexity is Small"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-1852-9116","authenticated-orcid":false,"given":"Sander","family":"Aarts","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3882-901X","authenticated-orcid":false,"given":"David B.","family":"Shmoys","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,12,22]]},"reference":[{"key":"12_CR1","doi-asserted-by":"crossref","unstructured":"Aronov, B., Ezra, E., Sharir, M.: Small-size $$\\varepsilon $$-nets for axis-parallel rectangles and boxes. In: Proceedings of the Forty-First Annual ACM Symposium on Theory of Computing, pp. 639\u2013648 (2009)","DOI":"10.1145\/1536414.1536501"},{"issue":"2","key":"12_CR2","doi-asserted-by":"publisher","first-page":"198","DOI":"10.1016\/0196-6774(81)90020-1","volume":"2","author":"R Bar-Yehuda","year":"1981","unstructured":"Bar-Yehuda, R., Even, S.: A linear-time approximation algorithm for the weighted vertex cover problem. J. Algorithms 2(2), 198\u2013203 (1981)","journal-title":"J. Algorithms"},{"key":"12_CR3","doi-asserted-by":"publisher","first-page":"263","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. Discret. Comput. Geom. 14, 263\u2013279 (1995)","journal-title":"Discret. Comput. Geom."},{"key":"12_CR4","doi-asserted-by":"crossref","unstructured":"Chan, T.M., Grant, E., K\u00f6nemann, J., Sharpe, M.: Weighted capacitated, priority, and geometric set cover via improved quasi-uniform sampling. In: Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2012, pp. 1576\u20131585. Society for Industrial and Applied Mathematics (2012)","DOI":"10.1137\/1.9781611973099.125"},{"issue":"3","key":"12_CR5","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1287\/moor.4.3.233","volume":"4","author":"V Chvatal","year":"1979","unstructured":"Chvatal, V.: A greedy heuristic for the set-covering problem. Math. Oper. Res. 4(3), 233\u2013235 (1979)","journal-title":"Math. Oper. Res."},{"issue":"4","key":"12_CR6","doi-asserted-by":"publisher","first-page":"830","DOI":"10.1137\/0217052","volume":"17","author":"KL Clarkson","year":"1988","unstructured":"Clarkson, K.L.: A randomized algorithm for closest-point queries. SIAM J. Comput. 17(4), 830\u2013847 (1988)","journal-title":"SIAM J. Comput."},{"issue":"2","key":"12_CR7","doi-asserted-by":"publisher","first-page":"358","DOI":"10.1016\/j.ipl.2005.03.010","volume":"95","author":"G Even","year":"2005","unstructured":"Even, G., Rawitz, D., Shahar, S.M.: Hitting sets when the VC-dimension is small. Inf. Process. Lett. 95(2), 358\u2013362 (2005)","journal-title":"Inf. Process. Lett."},{"issue":"4","key":"12_CR8","doi-asserted-by":"publisher","first-page":"634","DOI":"10.1145\/285055.285059","volume":"45","author":"U Feige","year":"1998","unstructured":"Feige, U.: A threshold of ln $$n$$ for approximating set cover. J. ACM (JACM) 45(4), 634\u2013652 (1998)","journal-title":"J. ACM (JACM)"},{"key":"12_CR9","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability, vol. 174. Freeman San Francisco (1979)"},{"issue":"2","key":"12_CR10","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1016\/0097-3165(95)90052-7","volume":"69","author":"D Haussler","year":"1995","unstructured":"Haussler, D.: Sphere packing numbers for subsets of the Boolean n-cube with bounded Vapnik-Chervonenkis dimension. J. Comb. Theory Ser. A 69(2), 217\u2013232 (1995)","journal-title":"J. Comb. Theory Ser. A"},{"key":"12_CR11","doi-asserted-by":"crossref","unstructured":"Haussler, D., Welzl, E.: Epsilon-nets and simplex range queries. In: Proceedings of the Second Annual Symposium on Computational Geometry, pp. 61\u201371 (1986)","DOI":"10.1145\/10515.10522"},{"key":"12_CR12","doi-asserted-by":"crossref","unstructured":"Johnson, D.S.: Approximation algorithms for combinatorial problems. In: Proceedings of the Fifth Annual ACM Symposium on Theory of Computing, pp. 38\u201349 (1973)","DOI":"10.1145\/800125.804034"},{"key":"12_CR13","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1007\/BF02187833","volume":"7","author":"J Koml\u00f3s","year":"1992","unstructured":"Koml\u00f3s, J., Pach, J., Woeginger, G.J.: Almost tight bounds for epsilon-nets. Discret. Comput. Geom. 7, 163\u2013173 (1992)","journal-title":"Discret. Comput. Geom."},{"issue":"3","key":"12_CR14","doi-asserted-by":"publisher","first-page":"739","DOI":"10.1007\/s00454-016-9767-5","volume":"55","author":"NH Mustafa","year":"2016","unstructured":"Mustafa, N.H.: A simple proof of the shallow packing lemma. Discret. Comput. Geom. 55(3), 739\u2013743 (2016)","journal-title":"Discret. Comput. Geom."},{"key":"12_CR15","unstructured":"Mustafa, N.H.: Computing optimal epsilon-nets is as easy as finding an unhit set. In: Baier, C., Chatzigiannakis, I., Flocchini, P., Leonardi, S. (eds.) 46th International Colloquium on Automata, Languages, and Programming, ICALP 2019, Patras, Greece, 9\u201312 July 2019. LIPIcs, vol. 132, pp. 87:1\u201387:12. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2019)"},{"key":"12_CR16","doi-asserted-by":"crossref","unstructured":"Mustafa, N.H.: Sampling in Combinatorial and Geometric Set Systems, vol. 265. American Mathematical Society (2022)","DOI":"10.1090\/surv\/265"},{"issue":"5","key":"12_CR17","doi-asserted-by":"publisher","first-page":"1269","DOI":"10.1007\/s00493-017-3564-5","volume":"38","author":"NH Mustafa","year":"2018","unstructured":"Mustafa, N.H., Dutta, K., Ghosh, A.: A simple proof of optimal epsilon nets. Combinatorica 38(5), 1269\u20131277 (2018)","journal-title":"Combinatorica"},{"key":"12_CR18","unstructured":"Mustafa, N.H., Varadarajan, K.: Epsilon-approximations & epsilon-nets. In: Handbook of Discrete and Computational Geometry, pp. 1241\u20131267. Chapman and Hall\/CRC (2017)"},{"key":"12_CR19","doi-asserted-by":"crossref","unstructured":"Varadarajan, K.: Epsilon nets and union complexity. In: Proceedings of the Twenty-Fifth Annual Symposium on Computational Geometry, pp. 11\u201316 (2009)","DOI":"10.1145\/1542362.1542366"},{"key":"12_CR20","doi-asserted-by":"crossref","unstructured":"Yousuf, A.M., Rochester, E.M., Ghaderi, M.: A low-cost LoRaWAN testbed for IoT: implementation and measurements. In: 2018 IEEE 4th World Forum on Internet of Things (WF-IoT), pp. 361\u2013366 (2018)","DOI":"10.1109\/WF-IoT.2018.8355180"}],"container-title":["Lecture Notes in Computer Science","Approximation and Online Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-49815-2_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,12,21]],"date-time":"2023-12-21T07:03:50Z","timestamp":1703142230000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-49815-2_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031498145","9783031498152"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-49815-2_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"22 December 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WAOA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Approximation and Online Algorithms","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Amsterdam","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"The Netherlands","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7 September 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 September 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"waoa2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/algo-conference.org\/2023\/waoa\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"easychair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"43","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"16","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"37% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3.05","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"7.7","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}