{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,23]],"date-time":"2025-07-23T12:26:49Z","timestamp":1753273609768,"version":"3.40.3"},"publisher-location":"Cham","reference-count":17,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031203497"},{"type":"electronic","value":"9783031203503"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"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":[[2022]]},"DOI":"10.1007\/978-3-031-20350-3_21","type":"book-chapter","created":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T05:12:32Z","timestamp":1672549952000},"page":"262-271","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["An Approximation Algorithm for\u00a0the\u00a0B-prize-collecting Multicut Problem in\u00a0Trees"],"prefix":"10.1007","author":[{"given":"Xiaofei","family":"Liu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Weidong","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,1,1]]},"reference":[{"issue":"1\u20132","key":"21_CR1","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1007\/s00453-011-9526-1","volume":"63","author":"D Du","year":"2012","unstructured":"Du, D., Lu, R., Xu, D.: A primal-dual approximation algorithm for the facility location problem with submodular penalties. Algorithmica 63(1\u20132), 191\u2013200 (2012)","journal-title":"Algorithmica"},{"key":"21_CR2","volume-title":"Computers and intractability: a guide to the theory of NP-completeness","author":"MR Garey","year":"1990","unstructured":"Garey, M.R., Johnson, D.S.: Computers and intractability: a guide to the theory of NP-completeness. W.H Freeman and Company, New York (1990)"},{"key":"21_CR3","doi-asserted-by":"crossref","unstructured":"Galby, E., Marx, D\u00e1niel., Schepper, P., Sharma, R., Tale, P.: Parameterized complexity of weighted multicut in trees. arXiv:2205.10105 (2022) https:\/\/doi.org\/10.48550\/arXiv.2205.10105","DOI":"10.1007\/978-3-031-15914-5_19"},{"key":"21_CR4","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/BF02523685","volume":"18","author":"N Garg","year":"1997","unstructured":"Garg, N., Vazirani, V.V., Yannakakis, M.: Primal-dual approximation algorithms for integral flow and multicut in trees. Algorithmica 18, 3\u201320 (1997)","journal-title":"Algorithmica"},{"key":"21_CR5","doi-asserted-by":"crossref","unstructured":"Guo, J., Liu, W., Hou, B.: An approximation algorithm for P-prize-collecting set cover problem. J. Oper. Res. Soc. China (2021) https:\/\/doi.org\/10.1007\/s40305-021-00364-7","DOI":"10.1007\/s40305-021-00364-7"},{"issue":"4","key":"21_CR6","doi-asserted-by":"publisher","first-page":"608","DOI":"10.1016\/j.jda.2005.07.005","volume":"4","author":"J Guo","year":"2006","unstructured":"Guo, J., Niedermeier, R.: Exact algorithms and applications for tree-like weighted set cover. J. Discrete Algorithms 4(4), 608\u2013622 (2006)","journal-title":"J. Discrete Algorithms"},{"key":"21_CR7","doi-asserted-by":"publisher","first-page":"573","DOI":"10.1007\/s11590-017-1135-8","volume":"13","author":"L Han","year":"2019","unstructured":"Han, L., Xu, D., Du, D., Wu, C.: A $$5$$-approximation algorithm for the $$k$$-prize-collecting Steiner tree problem. Opti. Lett.s 13, 573\u2013585 (2019)","journal-title":"Opti. Lett.s"},{"key":"21_CR8","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1016\/j.tcs.2020.07.014","volume":"844","author":"X Hou","year":"2020","unstructured":"Hou, X., Liu, W., Hou, B.: An approximation algorithm for the $$k$$-prize-collecting multicut on a tree problem. Theoret. Comput. Sci. 844, 26\u201333 (2020)","journal-title":"Theoret. Comput. Sci."},{"key":"21_CR9","volume-title":"Integer Programming and Network Flows","author":"TC Hu","year":"1969","unstructured":"Hu, T.C.: Integer Programming and Network Flows. Princeton University Press, Princeton (1969)"},{"issue":"4","key":"21_CR10","doi-asserted-by":"publisher","first-page":"489","DOI":"10.1007\/s00453-009-9317-0","volume":"59","author":"J K\u00f6nemann","year":"2011","unstructured":"K\u00f6nemann, J., Parekh, O., Segev, D.: A unified approach to approximating partial covering problems. Algorithmica 59(4), 489\u2013509 (2011)","journal-title":"Algorithmica"},{"issue":"1\u20133","key":"21_CR11","doi-asserted-by":"publisher","first-page":"384","DOI":"10.1016\/j.tcs.2006.09.018","volume":"369","author":"A Levin","year":"2006","unstructured":"Levin, A., Segev, D.: Partial multicuts in trees. Theoret. Comput. Sci. 369(1\u20133), 384\u2013395 (2006)","journal-title":"Theoret. Comput. Sci."},{"key":"21_CR12","doi-asserted-by":"publisher","first-page":"460","DOI":"10.1007\/s00453-014-9911-7","volume":"73","author":"Y Li","year":"2015","unstructured":"Li, Y., Du, D., Xiu, N., Xu, D.: Improved approximation algorithms for the facility location problems with linear \/submodular penalties. Algorithmica 73, 460\u2013482 (2015)","journal-title":"Algorithmica"},{"issue":"6","key":"21_CR13","doi-asserted-by":"publisher","first-page":"947","DOI":"10.1360\/SSI-2021-0445","volume":"52","author":"X Liu","year":"2022","unstructured":"Liu, X., Dai, H., Li, S., Li, W.: $$k$$-prize-collecting minimum power cover problem with submodular penalties on a plane (in Chinese). Scientia Sinica Informationis 52(6), 947 (2022)","journal-title":"Scientia Sinica Informationis"},{"key":"21_CR14","doi-asserted-by":"publisher","first-page":"1964","DOI":"10.1007\/s10878-020-00568-2","volume":"44","author":"X Liu","year":"2022","unstructured":"Liu, X., Li, W.: Combinatorial approximation algorithms for the submodular multicut problem in trees with submodular penalties. J. Comb. Opt. 44, 1964\u20131976 (2022). https:\/\/doi.org\/10.1007\/s10878-020-00568-2","journal-title":"J. Comb. Opt."},{"key":"21_CR15","doi-asserted-by":"publisher","first-page":"2373","DOI":"10.1007\/s10878-020-00568-2","volume":"16","author":"X Liu","year":"2022","unstructured":"Liu, X., Li, W., Xie, R.: A primal-dual approximation algorithm for the $$k$$-prize-collecting minimum power cover problem. Opt. Lett. 16, 2373\u20132385 (2022). https:\/\/doi.org\/10.1007\/s10878-020-00568-2","journal-title":"Opt. Lett."},{"issue":"3","key":"21_CR16","doi-asserted-by":"publisher","DOI":"10.1007\/s11704-022-1665-9","volume":"17","author":"X Liu","year":"2023","unstructured":"Liu, X., Li, W., Yang, J.: A primal-dual approximation algorithm for the $$k$$-prize-collecting minimum vertex cover problem with submodular penalties. Front. Comput. Sci. 17(3), 173404 (2023). https:\/\/doi.org\/10.1007\/s11704-022-1665-9","journal-title":"Front. Comput. Sci."},{"issue":"7\u20138","key":"21_CR17","doi-asserted-by":"publisher","first-page":"1240","DOI":"10.1016\/j.dam.2012.01.016","volume":"160","author":"P Zhang","year":"2012","unstructured":"Zhang, P., Zhu, D., Luan, J.: An approximation algorithm for the generalized $$k$$-multicut problem. Discret. Appl. Math. 160(7\u20138), 1240\u20131247 (2012)","journal-title":"Discret. Appl. Math."}],"container-title":["Lecture Notes in Computer Science","Theory and Applications of Models of Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-20350-3_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T05:24:56Z","timestamp":1672550696000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-20350-3_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031203497","9783031203503"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-20350-3_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"1 January 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"The authors declare that they have no known competing financial interests.","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declaration"}},{"value":"TAMC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Theory and Applications of Models of Computation","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16 September 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 September 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"tamc2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/lxy.tjut.edu.cn\/TAMC2022.htm","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":"EquinOCS","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"75","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":"33","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":"44% - 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":"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":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}