{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T15:40:05Z","timestamp":1742917205192,"version":"3.40.3"},"publisher-location":"Cham","reference-count":19,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031389054"},{"type":"electronic","value":"9783031389061"}],"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-38906-1_9","type":"book-chapter","created":{"date-parts":[[2023,7,27]],"date-time":"2023-07-27T16:05:14Z","timestamp":1690473914000},"page":"120-135","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Tight Approximation Algorithms for\u00a0Ordered Covering"],"prefix":"10.1007","author":[{"given":"Jatin","family":"Batra","sequence":"first","affiliation":[]},{"given":"Syamantak","family":"Das","sequence":"additional","affiliation":[]},{"given":"Agastya Vibhuti","family":"Jha","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,7,28]]},"reference":[{"issue":"4","key":"9_CR1","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1007\/s10107-018-1259-3","volume":"177","author":"A Aouad","year":"2019","unstructured":"Aouad, A., Segev, D.: The ordered k-median problem: surrogate models and approximation algorithms. Math. Program. 177(4), 55\u201383 (2019)","journal-title":"Math. Program."},{"key":"9_CR2","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1023\/B:JOCO.0000038913.96607.c2","volume":"8","author":"AA Ageev","year":"2004","unstructured":"Ageev, A.A., Sviridenko, M.I.: Pipage rounding: a new method of constructing algorithms with proven performance guarantee. J. Comb. Optim. 8, 307\u2013328 (2004)","journal-title":"J. Comb. Optim."},{"key":"9_CR3","doi-asserted-by":"crossref","unstructured":"Bansal, N., Batra, J., Farhadi, M., Tetali, P.: Improved approximations for min sum vertex cover and generalized min sum set cover. In: SODA 2021, pp. 986\u20131005. Society for Industrial and Applied Mathematics (2021)","DOI":"10.1137\/1.9781611976465.62"},{"key":"9_CR4","unstructured":"Braverman, V., Jiang, S.H.-C., Krauthgamer, R., Wu, X.: Coresets for ordered weighted clustering. In: Chaudhuri, K., Salakhutdinov, R. (eds.) Proceedings of the 36th International Conference on Machine Learning. Proceedings of Machine Learning Research, vol. 97, pp. 744\u2013753. PMLR (2019)"},{"key":"9_CR5","doi-asserted-by":"publisher","unstructured":"Byrka, J., Sornat, K., Spoerhase, J.: Constant-factor approximation for ordered k-median. In: Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing, STOC 2018, New York, NY, USA, pp. 620\u2013631. Association for Computing Machinery (2018). https:\/\/doi.org\/10.1145\/3188745.3188930","DOI":"10.1145\/3188745.3188930"},{"key":"9_CR6","unstructured":"Chakrabarty, D., Swamy, C.: Interpolating between k-median and k-center: approximation algorithms for ordered k-median. In: 45th International Colloquium on Automata, Languages, and Programming, ICALP 2018 (2018)"},{"key":"9_CR7","unstructured":"Chakrabarty, D., Swamy, C.: Simpler and better algorithms for minimum-norm load balancing. In: 27th Annual European Symposium on Algorithms. LIPIcs, vol. 144, pp. 27:1\u201327:12 (2019)"},{"key":"9_CR8","doi-asserted-by":"crossref","unstructured":"Chakrabarty, D., Swamy, C.: Approximation algorithms for minimum norm and ordered optimization problems. In: STOC 2019, New York, NY, USA. Association for Computing Machinery (2019)","DOI":"10.1145\/3313276.3316322"},{"issue":"4","key":"9_CR9","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 45(4), 634\u2013652 (1998). https:\/\/doi.org\/10.1145\/285055.285059","journal-title":"J. ACM"},{"issue":"4","key":"9_CR10","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1007\/s00453-004-1110-5","volume":"40","author":"U Feige","year":"2004","unstructured":"Feige, U., Lov\u00e1sz, L., Tetali, P.: Approximating min sum set cover. Algorithmica 40(4), 219\u2013234 (2004)","journal-title":"Algorithmica"},{"key":"9_CR11","unstructured":"Golovin, D., Gupta, A., Kumar, A., Tangwongsan, K.: All-norms and all-$$l_p$$-norms approximation algorithms. In: Leibniz International Proceedings in Informatics. LIPIcs, vol. 2 (2008)"},{"issue":"3","key":"9_CR12","doi-asserted-by":"publisher","first-page":"324","DOI":"10.1145\/1147954.1147956","volume":"53","author":"R Gandhi","year":"2006","unstructured":"Gandhi, R., Khuller, S., Parthasarathy, S., Srinivasan, A.: Dependent rounding and its applications to approximation algorithms. J. ACM 53(3), 324\u2013360 (2006)","journal-title":"J. ACM"},{"key":"9_CR13","first-page":"94","volume-title":"Approximating Covering and Packing Problems: Set Cover, Vertex Cover, Independent Set, and Related Problems","author":"DS Hochbaum","year":"1996","unstructured":"Hochbaum, D.S.: Approximating Covering and Packing Problems: Set Cover, Vertex Cover, Independent Set, and Related Problems, pp. 94\u2013143. PWS Publishing Co., USA (1996)"},{"key":"9_CR14","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2987751","volume":"13","author":"S Im","year":"2016","unstructured":"Im, S., Nagarajan, V., Van Der Zwaan, R.: Minimum latency submodular cover. ACM Trans. Algorithms 13, 1\u201328 (2016)","journal-title":"ACM Trans. Algorithms"},{"key":"9_CR15","doi-asserted-by":"publisher","unstructured":"Ibrahimpur, S., Swamy, C.: Approximation algorithms for stochastic minimum-norm combinatorial optimization. In: 2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS), pp. 966\u2013977 (2020). https:\/\/doi.org\/10.1109\/FOCS46700.2020.00094","DOI":"10.1109\/FOCS46700.2020.00094"},{"key":"9_CR16","doi-asserted-by":"publisher","unstructured":"Johnson, D.S.: Approximation algorithms for combinatorial problems. In: Proceedings of the Fifth Annual ACM Symposium on Theory of Computing, STOC 1973, New York, NY, USA, pp. 38\u201349. Association for Computing Machinery (1973). https:\/\/doi.org\/10.1145\/800125.804034","DOI":"10.1145\/800125.804034"},{"issue":"3","key":"9_CR17","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1016\/j.jcss.2007.06.019","volume":"74","author":"S Khot","year":"2008","unstructured":"Khot, S., Regev, O.: Vertex cover might be hard to approximate to within $$2-\\varepsilon $$. J. Comput. Syst. Sci. 74(3), 335\u2013349 (2008). Computational Complexity 2003","journal-title":"J. Comput. Syst. Sci."},{"key":"9_CR18","doi-asserted-by":"publisher","unstructured":"Slav\u00edk, P.: A tight analysis of the greedy algorithm for set cover. In: Proceedings of the Twenty-Eighth Annual ACM Symposium on Theory of Computing, STOC 1996, New York, NY, USA, pp. 435\u2013441. Association for Computing Machinery (1996). https:\/\/doi.org\/10.1145\/237814.237991","DOI":"10.1145\/237814.237991"},{"key":"9_CR19","doi-asserted-by":"crossref","unstructured":"Srinivasan, A.: Distributions on level-sets with applications to approximation algorithms. In: Proceedings 2001 IEEE International Conference on Cluster Computing, pp. 588\u2013597 (2001)","DOI":"10.1109\/SFCS.2001.959935"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Data Structures"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-38906-1_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,7,27]],"date-time":"2023-07-27T16:06:12Z","timestamp":1690473972000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-38906-1_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031389054","9783031389061"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-38906-1_9","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":"28 July 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WADS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Algorithms and Data Structures Symposium","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Montreal, QC","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Canada","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":"31 July 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2 August 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"wads2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/wads.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-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":"92","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":"47","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":"51% - 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.1","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":"10","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)"}}]}}