{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T14:48:49Z","timestamp":1743000529803,"version":"3.40.3"},"publisher-location":"Cham","reference-count":11,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319937007"},{"type":"electronic","value":"9783319937014"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"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":[[2018]]},"DOI":"10.1007\/978-3-319-93701-4_43","type":"book-chapter","created":{"date-parts":[[2018,6,11]],"date-time":"2018-06-11T11:49:52Z","timestamp":1528717792000},"page":"553-560","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["A Fast Vertex-Swap Operator for the Prize-Collecting Steiner Tree Problem"],"prefix":"10.1007","author":[{"given":"Yi-Fei","family":"Ming","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Si-Bo","family":"Chen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yong-Quan","family":"Chen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhang-Hua","family":"Fu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,6,12]]},"reference":[{"key":"43_CR1","unstructured":"Johnson, D.S., Minkoff, M., Phillips, S.: The prize collecting Steiner tree problem: theory and practice. In: Proceeding of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms, Philadelphia, USA, pp. 760\u2013769 (2000)"},{"key":"43_CR2","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1002\/net.1023","volume":"38","author":"SA Canuto","year":"2001","unstructured":"Canuto, S.A., Resende, M.G.C., Ribeiro, C.C.: Local search with perturbations for the prize collecting Steiner tree problem in graphs. Networks 38, 50\u201358 (2001)","journal-title":"Networks"},{"key":"43_CR3","first-page":"2491","volume":"14","author":"EFG Goldbarg","year":"2008","unstructured":"Goldbarg, E.F.G., Goldbarg, M.C., Schmidt, C.C.: A hybrid transgenetic algorithm for the prize collecting Steiner tree problem. J. Univers. Comput. Sci. 14, 2491\u20132511 (2008)","journal-title":"J. Univers. Comput. Sci."},{"key":"43_CR4","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1016\/j.cor.2015.12.015","volume":"70","author":"M Akhmedov","year":"2016","unstructured":"Akhmedov, M., Kwee, I., Montemanni, R.: A divide and conquer matheuristic algorithm for the prize-collecting Steiner tree problem. Comput. Oper. Res. 70, 18\u201325 (2016)","journal-title":"Comput. Oper. Res."},{"key":"43_CR5","doi-asserted-by":"publisher","first-page":"78","DOI":"10.1016\/j.knosys.2017.04.010","volume":"128","author":"ZH Fu","year":"2017","unstructured":"Fu, Z.H., Hao, J.K.: Knowledge-guided local search for the prize-collecting Steiner tree problem in graphs. Knowl.-Based Syst. 128, 78\u201392 (2017)","journal-title":"Knowl.-Based Syst."},{"key":"43_CR6","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1007\/s12532-016-0116-8","volume":"9","author":"ZH Fu","year":"2017","unstructured":"Fu, Z.H., Hao, J.K.: Swap-vertex based neighborhood for Steiner tree problems. Math. Progr. Comput. 9, 297\u2013320 (2017)","journal-title":"Math. Progr. Comput."},{"key":"43_CR7","doi-asserted-by":"publisher","first-page":"362","DOI":"10.1016\/0022-0000(83)90006-5","volume":"26","author":"DD Sleator","year":"1983","unstructured":"Sleator, D.D., Tarjan, R.E.: A data structure for dynamic trees. J. Comput. Syst. Sci. 26, 362\u2013391 (1983)","journal-title":"J. Comput. Syst. Sci."},{"key":"43_CR8","doi-asserted-by":"publisher","first-page":"652","DOI":"10.1145\/3828.3835","volume":"32","author":"DD Sleator","year":"1985","unstructured":"Sleator, D.D., Tarjan, R.E.: Self-adjusting binary search trees. J. ACM 32, 652\u2013686 (1985)","journal-title":"J. ACM"},{"key":"43_CR9","first-page":"1","volume-title":"2010 Proceedings of the Twelfth Workshop on Algorithm Engineering and Experiments (ALENEX)","author":"Eduardo Uchoa","year":"2010","unstructured":"Uchoa, E., Werneck, R.F., Fast local search for Steiner trees in graphs. In: 2010 Proceedings of the Twelfth Workshop on Algorithm Engineering and Experiments, ALENEX. pp. 1\u201310. Society for Industrial and Applied Mathematics (2010)"},{"key":"43_CR10","doi-asserted-by":"publisher","first-page":"375","DOI":"10.1137\/0204032","volume":"4","author":"PM Spira","year":"1975","unstructured":"Spira, P.M., Pan, A.: On finding and updating spanning trees and shortest paths. SIAM J. Comput. 4, 375\u2013380 (1975)","journal-title":"SIAM J. Comput."},{"key":"43_CR11","doi-asserted-by":"publisher","first-page":"530","DOI":"10.1007\/s00453-001-0061-3","volume":"31","author":"B Das","year":"2001","unstructured":"Das, B., Michael, C.L.: Reconstructing a minimum spanning tree after deletion of any node. Algorithmica 31, 530\u2013547 (2001)","journal-title":"Algorithmica"}],"container-title":["Lecture Notes in Computer Science","Computational Science \u2013 ICCS 2018"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-93701-4_43","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,6,11]],"date-time":"2022-06-11T00:16:31Z","timestamp":1654906591000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-93701-4_43"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319937007","9783319937014"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-93701-4_43","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"12 June 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICCS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Computational Science","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Wuxi","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 June 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13 June 2018","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":"iccs-computsci2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.iccs-meeting.org\/iccs2018\/","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":"406","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":"148","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":"60","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":"36% - 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":"3","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)"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}