{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T05:41:48Z","timestamp":1742967708085,"version":"3.40.3"},"publisher-location":"Cham","reference-count":14,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030927011"},{"type":"electronic","value":"9783030927028"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-92702-8_15","type":"book-chapter","created":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T06:00:24Z","timestamp":1641016824000},"page":"234-251","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Precedence-Constrained Covering Problems with\u00a0Multiplicity Constraints"],"prefix":"10.1007","author":[{"given":"Stavros G.","family":"Kolliopoulos","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7623-9419","authenticated-orcid":false,"given":"Antonis","family":"Skarlatos","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,1,1]]},"reference":[{"key":"15_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"288","DOI":"10.1007\/978-3-540-68891-4_20","volume-title":"Integer Programming and Combinatorial Optimization","author":"T Carnes","year":"2008","unstructured":"Carnes, T., Shmoys, D.: Primal-dual schema for capacitated covering problems. In: Lodi, A., Panconesi, A., Rinaldi, G. (eds.) IPCO 2008. LNCS, vol. 5035, pp. 288\u2013302. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-68891-4_20"},{"unstructured":"Carr, R.D., Fleischer, L., Leung, V.J., Phillips, C.A.: Strengthening integrality gaps for capacitated network design and covering problems. In: SODA, pp. 106\u2013115 (2000)","key":"15_CR2"},{"key":"15_CR3","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1007\/978-0-8176-4842-8_10","volume-title":"Classic Papers in Combinatorics","author":"RP Dilworth","year":"2009","unstructured":"Dilworth, R.P.: A decomposition theorem for partially ordered sets. In: Gessel, I., Rota, G.C. (eds.) Classic Papers in Combinatorics, pp. 139\u2013144. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-0-8176-4842-8_10"},{"issue":"5","key":"15_CR4","doi-asserted-by":"publisher","first-page":"1129","DOI":"10.1137\/S0097539704443057","volume":"34","author":"I Dinur","year":"2005","unstructured":"Dinur, I., Guruswami, V., Khot, S., Regev, O.: A new multilayered PCP and the hardness of hypergraph vertex cover. SIAM J. Comput. 34(5), 1129\u20131146 (2005). https:\/\/doi.org\/10.1137\/S0097539704443057","journal-title":"SIAM J. Comput."},{"key":"15_CR5","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1016\/j.dam.2015.05.020","volume":"194","author":"D Espinoza","year":"2015","unstructured":"Espinoza, D., Goycoolea, M., Moreno, E.: The precedence constrained knapsack problem: Separating maximally violated inequalities. Disc. Appl. Math. 194, 65\u201380 (2015). https:\/\/doi.org\/10.1016\/j.dam.2015.05.020","journal-title":"Disc. Appl. Math."},{"key":"15_CR6","first-page":"299","volume-title":"Handbook of Combinatorial Optimization","author":"H Kellerer","year":"2004","unstructured":"Kellerer, H., Pferschy, U., Pisinger, D.: Knapsack problems. In: Du, D.Z., Pardalos, P.M. (eds.) Handbook of Combinatorial Optimization, pp. 299\u2013428. Springer, Heidelberg (2004)"},{"issue":"3","key":"15_CR7","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-epsilon. J. Comput. Syst. Sci. 74(3), 335\u2013349 (2008). https:\/\/doi.org\/10.1016\/j.jcss.2007.06.019","journal-title":"J. Comput. Syst. Sci."},{"key":"15_CR8","doi-asserted-by":"publisher","first-page":"495","DOI":"10.1016\/j.jcss.2005.05.002","volume":"71","author":"SG Kolliopoulos","year":"2005","unstructured":"Kolliopoulos, S.G., Young, N.E.: Approximation algorithms for covering\/packing integer programs. J. Comput. Syst. Sci. 71, 495\u2013505 (2005)","journal-title":"J. Comput. Syst. Sci."},{"issue":"1","key":"15_CR9","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1007\/s00453-012-9629-3","volume":"66","author":"C Koufogiannakis","year":"2013","unstructured":"Koufogiannakis, C., Young, N.E.: Greedy $$\\Delta $$-approximation algorithm for covering with arbitrary constraints and submodular cost. Algorithmica 66(1), 113\u2013152 (2013). https:\/\/doi.org\/10.1007\/s00453-012-9629-3","journal-title":"Algorithmica"},{"issue":"3","key":"15_CR10","doi-asserted-by":"publisher","first-page":"771","DOI":"10.1007\/s00453-016-0174-3","volume":"78","author":"ST McCormick","year":"2017","unstructured":"McCormick, S.T., Peis, B., Verschae, J., Wierz, A.: Primal-dual algorithms for precedence constrained covering problems. Algorithmica 78(3), 771\u2013787 (2017)","journal-title":"Algorithmica"},{"issue":"1","key":"15_CR11","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1007\/s00453-010-9431-z","volume":"61","author":"D Pritchard","year":"2011","unstructured":"Pritchard, D., Chakrabarty, D.: Approximability of sparse integer programs. Algorithmica 61(1), 75\u201393 (2011)","journal-title":"Algorithmica"},{"doi-asserted-by":"crossref","unstructured":"Trevisan, L.: Non-approximability results for optimization problems on bounded degree instances. In: Proceedings of the Thirty-Third Annual ACM Symposium on Theory of Computing, pp. 453\u2013461 (2001)","key":"15_CR12","DOI":"10.1145\/380752.380839"},{"issue":"1","key":"15_CR13","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1016\/S0166-218X(02)00427-4","volume":"131","author":"GJ Woeginger","year":"2003","unstructured":"Woeginger, G.J.: On the approximability of average completion time scheduling under precedence constraints. Disc. Appl. Math. 131(1), 237\u2013252 (2003)","journal-title":"Disc. Appl. Math."},{"key":"15_CR14","doi-asserted-by":"publisher","first-page":"168","DOI":"10.1007\/BF01580441","volume":"8","author":"L Wolsey","year":"1975","unstructured":"Wolsey, L.: Facets for a linear inequality in 0\u20131 variables. Math. Program. 8, 168\u2013175 (1975)","journal-title":"Math. Program."}],"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-030-92702-8_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T06:23:09Z","timestamp":1641018189000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-92702-8_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030927011","9783030927028"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-92702-8_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"1 January 2022","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":"Lisbon","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Portugal","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6 September 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 September 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"waoa2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/algo2021.tecnico.ulisboa.pt\/WAOA2021\/index.html","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":"31","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":"52% - 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","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":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}