{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T07:15:53Z","timestamp":1742973353919,"version":"3.40.3"},"publisher-location":"Cham","reference-count":25,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031556005"},{"type":"electronic","value":"9783031556012"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"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":[[2024]]},"DOI":"10.1007\/978-3-031-55601-2_11","type":"book-chapter","created":{"date-parts":[[2024,3,5]],"date-time":"2024-03-05T19:02:17Z","timestamp":1709665337000},"page":"162-176","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Knapsack: Connectedness, Path, and\u00a0Shortest-Path"],"prefix":"10.1007","author":[{"given":"Palash","family":"Dey","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sudeshna","family":"Kolay","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sipra","family":"Singh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,3,6]]},"reference":[{"key":"11_CR1","doi-asserted-by":"crossref","unstructured":"A faster parameterized algorithm for pseudoforest deletion. Discrete Applied Mathematics 236, 42\u201356 (2018)","DOI":"10.1016\/j.dam.2017.10.018"},{"key":"11_CR2","doi-asserted-by":"publisher","unstructured":"Bettinelli, A., Cacchiani, V., Malaguti, E.: A branch-and-bound algorithm for the knapsack problem with conflict graph. INFORMS J. Comput. 29(3), 457\u2013473 (2017). https:\/\/doi.org\/10.1287\/ijoc.2016.0742","DOI":"10.1287\/ijoc.2016.0742"},{"key":"11_CR3","doi-asserted-by":"publisher","unstructured":"Bonomo, F., de Estrada, D.: On the thinness and proper thinness of a graph. Discret. Appl. Math. 261, 78\u201392 (2019). https:\/\/doi.org\/10.1016\/J.DAM.2018.03.072","DOI":"10.1016\/J.DAM.2018.03.072"},{"key":"11_CR4","doi-asserted-by":"publisher","unstructured":"Bonomo-Braberman, F., Gonzalez, C.L.: A new approach on locally checkable problems. Discret. Appl. Math. 314, 53\u201380 (2022). https:\/\/doi.org\/10.1016\/J.DAM.2022.01.019","DOI":"10.1016\/J.DAM.2022.01.019"},{"key":"11_CR5","doi-asserted-by":"publisher","unstructured":"Cacchiani, V., Iori, M., Locatelli, A., Martello, S.: Knapsack problems - an overview of recent advances. part I: single knapsack problems. Comput. Oper. Res. 143, 105692 (2022). https:\/\/doi.org\/10.1016\/j.cor.2021.105692,","DOI":"10.1016\/j.cor.2021.105692"},{"key":"11_CR6","doi-asserted-by":"publisher","unstructured":"Cacchiani, V., Iori, M., Locatelli, A., Martello, S.: Knapsack problems - an overview of recent advances. part II: multiple, multidimensional, and quadratic knapsack problems. Comput. Oper. Res. 143, 105693 (2022). https:\/\/doi.org\/10.1016\/j.cor.2021.105693","DOI":"10.1016\/j.cor.2021.105693"},{"key":"11_CR7","doi-asserted-by":"publisher","unstructured":"Coniglio, S., Furini, F., Segundo, P.S.: A new combinatorial branch-and-bound algorithm for the knapsack problem with conflicts. Eur. J. Oper. Res. 289(2), 435\u2013455 (2021). https:\/\/doi.org\/10.1016\/j.ejor.2020.07.023","DOI":"10.1016\/j.ejor.2020.07.023"},{"key":"11_CR8","unstructured":"Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms, 3rd Edition. MIT Press (2009). http:\/\/mitpress.mit.edu\/books\/introduction-algorithms"},{"key":"11_CR9","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-21275-3","volume-title":"Parameterized Algorithms","author":"M Cygan","year":"2015","unstructured":"Cygan, M., et al.: Parameterized Algorithms. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-21275-3"},{"key":"11_CR10","doi-asserted-by":"crossref","unstructured":"Dey, P., Kolay, S., Singh, S.: Knapsack: Connectedness, path, and shortest-path. CoRR abs\/2307.12547 (2023)","DOI":"10.1007\/978-3-031-55601-2_11"},{"key":"11_CR11","doi-asserted-by":"publisher","unstructured":"Fleischner, H., Sabidussi, G., Sarvanov, V.I.: Maximum independent sets in 3- and 4-regular hamiltonian graphs. Discret. Math. 310(20), 2742\u20132749 (2010). https:\/\/doi.org\/10.1016\/j.disc.2010.05.028","DOI":"10.1016\/j.disc.2010.05.028"},{"key":"11_CR12","doi-asserted-by":"publisher","unstructured":"Garey, M.R., Johnson, D.S., Stockmeyer, L.J.: Some simplified np-complete problems. In: Constable, R.L., Ritchie, R.W., Carlyle, J.W., Harrison, M.A. (eds.) Proc. 6th Annual ACM Symposium on Theory of Computing, April 30 - May 2, 1974, Seattle, Washington, USA, pp. 47\u201363. ACM (1974). https:\/\/doi.org\/10.1145\/800119.803884","DOI":"10.1145\/800119.803884"},{"key":"11_CR13","doi-asserted-by":"publisher","unstructured":"Goebbels, S., Gurski, F., Komander, D.: The knapsack problem with special neighbor constraints. Math. Methods Oper. Res. 95(1), 1\u201334 (2022). https:\/\/doi.org\/10.1007\/s00186-021-00767-5","DOI":"10.1007\/s00186-021-00767-5"},{"key":"11_CR14","doi-asserted-by":"publisher","unstructured":"Gurski, F., Rehs, C.: Solutions for the knapsack problem with conflict and forcing graphs of bounded clique-width. Math. Methods Oper. Res. 89(3), 411\u2013432 (2019). https:\/\/doi.org\/10.1007\/s00186-019-00664-y","DOI":"10.1007\/s00186-019-00664-y"},{"key":"11_CR15","doi-asserted-by":"publisher","unstructured":"Held, S., Cook, W.J., Sewell, E.C.: Maximum-weight stable sets and safe lower bounds for graph coloring. Math. Program. Comput. 4(4), 363\u2013381 (2012). https:\/\/doi.org\/10.1007\/s12532-012-0042-3","DOI":"10.1007\/s12532-012-0042-3"},{"issue":"6","key":"11_CR16","doi-asserted-by":"publisher","first-page":"718","DOI":"10.1057\/palgrave.jors.2602046","volume":"57","author":"M Hifi","year":"2006","unstructured":"Hifi, M., Michrafy, M.: A reactive local search-based algorithm for the disjunctively constrained knapsack problem. J. Oper. Res. Society 57(6), 718\u2013726 (2006)","journal-title":"J. Oper. Res. Society"},{"issue":"9","key":"11_CR17","doi-asserted-by":"publisher","first-page":"2657","DOI":"10.1016\/j.cor.2005.10.004","volume":"34","author":"M Hifi","year":"2007","unstructured":"Hifi, M., Michrafy, M.: Reduction strategies and exact algorithms for the disjunctively constrained knapsack problem. Comput. Oper. Res. 34(9), 2657\u20132673 (2007)","journal-title":"Comput. Oper. Res."},{"issue":"4","key":"11_CR18","doi-asserted-by":"publisher","first-page":"627","DOI":"10.1016\/j.jda.2008.03.002","volume":"6","author":"T Ito","year":"2008","unstructured":"Ito, T., Demaine, E.D., Zhou, X., Nishizeki, T.: Approximability of partitioning graphs with supply and demand. J. Discr. Algorithms 6(4), 627\u2013650 (2008)","journal-title":"J. Discr. Algorithms"},{"key":"11_CR19","doi-asserted-by":"publisher","unstructured":"Kellerer, H., Pferschy, U., Pisinger, D., Kellerer, H., Pferschy, U., Pisinger, D.: Multidimensional knapsack problems. Springer (2004). https:\/\/doi.org\/10.1007\/978-3-540-24777-7_9","DOI":"10.1007\/978-3-540-24777-7_9"},{"key":"11_CR20","doi-asserted-by":"publisher","unstructured":"Luiz, T.A., Santos, H.G., Uchoa, E.: Cover by disjoint cliques cuts for the knapsack problem with conflicting items. Oper. Res. Lett. 49(6), 844\u2013850 (2021). https:\/\/doi.org\/10.1016\/j.orl.2021.10.001","DOI":"10.1016\/j.orl.2021.10.001"},{"key":"11_CR21","doi-asserted-by":"publisher","unstructured":"Mannino, C., Oriolo, G., Ricci-Tersenghi, F., Chandran, L.S.: The stable set problem and the thinness of a graph. Oper. Res. Lett. 35(1), 1\u20139 (2007). https:\/\/doi.org\/10.1016\/J.ORL.2006.01.009","DOI":"10.1016\/J.ORL.2006.01.009"},{"key":"11_CR22","unstructured":"Martello, S., Toth, P.: Knapsack problems: algorithms and computer implementations. John Wiley & Sons, Inc. (1990)"},{"key":"11_CR23","doi-asserted-by":"publisher","unstructured":"Pferschy, U., Schauer, J.: The knapsack problem with conflict graphs. J. Graph Algorithms Appl. 13(2), 233\u2013249 (2009). https:\/\/doi.org\/10.7155\/jgaa.00186","DOI":"10.7155\/jgaa.00186"},{"key":"11_CR24","doi-asserted-by":"publisher","unstructured":"Pferschy, U., Schauer, J.: Approximation of knapsack problems with conflict and forcing graphs. J. Comb. Optim. 33(4), 1300\u20131323 (2017). https:\/\/doi.org\/10.1007\/s10878-016-0035-7","DOI":"10.1007\/s10878-016-0035-7"},{"key":"11_CR25","unstructured":"Yamada, T., Kataoka, S., Watanabe, K.: Heuristic and exact algorithms for the disjunctively constrained knapsack problem. Inform. Process. Society Japan J. 43(9) (2002)"}],"container-title":["Lecture Notes in Computer Science","LATIN 2024: Theoretical Informatics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-55601-2_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,11,13]],"date-time":"2024-11-13T21:35:14Z","timestamp":1731533714000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-55601-2_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031556005","9783031556012"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-55601-2_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"6 March 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"LATIN","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Latin American Symposium on Theoretical Informatics","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Puerto Varas","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Chile","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 March 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22 March 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"latin2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/latin2024.cmm.uchile.cl\/","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":"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":"44","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":"48% - 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.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)"}}]}}