{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T16:28:35Z","timestamp":1742920115441,"version":"3.40.3"},"publisher-location":"Cham","reference-count":18,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030727918"},{"type":"electronic","value":"9783030727925"}],"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-72792-5_24","type":"book-chapter","created":{"date-parts":[[2021,4,26]],"date-time":"2021-04-26T20:34:22Z","timestamp":1619469262000},"page":"263-273","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Approximation Algorithms for the Balanced Optimization Splicing Problem in Undirected Graph"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-2170-8414","authenticated-orcid":false,"given":"Yongsong","family":"Wen","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,4,27]]},"reference":[{"issue":"2","key":"24_CR1","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1016\/j.disopt.2014.01.001","volume":"12","author":"AP Punnen","year":"2014","unstructured":"Punnen, A.P., Taghipour, S., Karapetyan, D., Bhattacharyya, B.: The quadratic balanced optimization problem. Discret. Optim. 12(2), 47\u201360 (2014). https:\/\/doi.org\/10.1016\/j.disopt.2014.01.001","journal-title":"Discret. Optim."},{"issue":"1","key":"24_CR2","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1016\/0167-6377(91)90085-4","volume":"10","author":"CW Duin","year":"1991","unstructured":"Duin, C.W., Volgenant, A.: Minimum deviation and balanced optimization: a unifed approach. Oper. Res. Lett. 10(1), 43\u201348 (1991). https:\/\/doi.org\/10.1016\/0167-6377(91)90085-4","journal-title":"Oper. Res. Lett."},{"issue":"5","key":"24_CR3","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1016\/0167-6377(84)90061-0","volume":"3","author":"S Martello","year":"1984","unstructured":"Martello, S., Pulleyblank, W.R., Toth, P., Werra, D.: Balanced optimization problems. Oper. Res. Lett. 3(5), 275\u2013278 (1984). https:\/\/doi.org\/10.1016\/0167-6377(84)90061-0","journal-title":"Oper. Res. Lett."},{"issue":"2","key":"24_CR4","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1016\/0166-218X(86)90041-7","volume":"15","author":"PM Camerni","year":"1986","unstructured":"Camerni, P.M., Maffioli, F., Martello, S., Toth, P.: Most and least uniform spanning trees. Discret. Appl. Math. 15(2), 181\u2013197 (1986). https:\/\/doi.org\/10.1016\/0166-218X(86)90041-7","journal-title":"Discret. Appl. Math."},{"issue":"2","key":"24_CR5","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1016\/0166-218X(88)90062-5","volume":"20","author":"Z Galil","year":"1988","unstructured":"Galil, Z., Schieber, B.: On finding most uniform spanning trees. Discret. Appl. Math. 20(2), 173\u2013175 (1988). https:\/\/doi.org\/10.1016\/0166-218X(88)90062-5","journal-title":"Discret. Appl. Math."},{"key":"24_CR6","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1016\/S0898-1221(99)00119-4","volume":"37","author":"AP Punnen","year":"1999","unstructured":"Punnen, A.P., Nair, K.P.K.: Constrained balanced optimization problems. Comput. Math. Appl. 37, 157\u2013163 (1999). https:\/\/doi.org\/10.1016\/S0898-1221(99)00119-4","journal-title":"Comput. Math. Appl."},{"key":"24_CR7","doi-asserted-by":"publisher","first-page":"776","DOI":"10.1166\/asl.2012.3033","volume":"11","author":"L Wu","year":"2012","unstructured":"Wu, L.: An efficient algorithm for the most balanced spanning tree problems. Adv. Sci. Lett. 11, 776\u2013778 (2012). https:\/\/doi.org\/10.1166\/asl.2012.3033","journal-title":"Adv. Sci. Lett."},{"issue":"1","key":"24_CR8","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1016\/S0167-6377(03)00065-8","volume":"32","author":"AP Punnen","year":"2004","unstructured":"Punnen, A.P., Aneja, Y.P.: Lexicographic balanced optimization problems. Oper. Res. Lett. 32(1), 27\u201330 (2004). https:\/\/doi.org\/10.1016\/S0167-6377(03)00065-8","journal-title":"Oper. Res. Lett."},{"issue":"4","key":"24_CR9","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1016\/0167-6377(88)90029-6","volume":"7","author":"SK Gupta","year":"1988","unstructured":"Gupta, S.K., Punnen, A.P.: Minimum deviation problems. Oper. Res. Lett. 7(4), 201\u2013204 (1988). https:\/\/doi.org\/10.1016\/0167-6377(88)90029-6","journal-title":"Oper. Res. Lett."},{"issue":"2","key":"24_CR10","doi-asserted-by":"publisher","first-page":"104","DOI":"10.1002\/net.20053","volume":"45","author":"P Cappanera","year":"2005","unstructured":"Cappanera, P., Scutella, M.G.: Balanced paths in acyclic networks: Tractable cases and related approaches. Networks 45(2), 104\u2013111 (2005). https:\/\/doi.org\/10.1002\/net.20053","journal-title":"Networks"},{"issue":"1","key":"24_CR11","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1016\/S0377-2217(96)00142-7","volume":"101","author":"RK Ahuja","year":"1997","unstructured":"Ahuja, R.K.: The balanced linear programming problem. Eur. J. Oper. Res. 101(1), 29\u201338 (1997). https:\/\/doi.org\/10.1016\/S0377-2217(96)00142-7","journal-title":"Eur. J. Oper. Res."},{"issue":"2","key":"24_CR12","doi-asserted-by":"publisher","first-page":"375","DOI":"10.1006\/jagm.1996.0841","volume":"23","author":"D Eppstein","year":"1997","unstructured":"Eppstein, D.: Minimum range balanced cuts via dynamic subset sums. J. Algorithms 23(2), 375\u2013385 (1997). https:\/\/doi.org\/10.1006\/jagm.1996.0841","journal-title":"J. Algorithms"},{"issue":"2","key":"24_CR13","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1016\/j.ejor.2013.07.033","volume":"232","author":"J Li","year":"2014","unstructured":"Li, J., Ge, Y., He, S., et al.: Approximation algorithms for constructing some required structures in digraphs. Eur. J. Oper. Res. 232(2), 307\u2013314 (2014). https:\/\/doi.org\/10.1016\/j.ejor.2013.07.033","journal-title":"Eur. J. Oper. Res."},{"issue":"5","key":"24_CR14","doi-asserted-by":"publisher","first-page":"868","DOI":"10.1016\/j.cor.2010.09.016","volume":"38","author":"J LaRusic","year":"2011","unstructured":"LaRusic, J., Punnen, A.P.: The balanced traveling salesman problem. Comput. Oper. Res. 38(5), 868\u2013875 (2011)","journal-title":"Comput. Oper. Res."},{"key":"24_CR15","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-04565-7","volume-title":"Approximation Algorithms","author":"Vijay V Vazirani","year":"2003","unstructured":"Vazirani, Vijay V.: Approximation Algorithms. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/978-3-662-04565-7"},{"issue":"4","key":"24_CR16","doi-asserted-by":"publisher","first-page":"579","DOI":"10.1002\/1520-6750(199406)41:4","volume":"41","author":"D Simchi-Levi","year":"1994","unstructured":"Simchi-Levi, D.: New worst case results for the bin-packing problem. Nav. Res. Logist. 41(4), 579\u2013858 (1994). https:\/\/doi.org\/10.1002\/1520-6750(199406)41:4","journal-title":"Nav. Res. Logist."},{"key":"24_CR17","doi-asserted-by":"publisher","DOI":"10.1109\/TASSP.1984.1164450","volume-title":"Combinatorial Optimization: Algorithms and Complexity","author":"CH Papadimitiou","year":"1988","unstructured":"Papadimitiou, C.H., Steiglitz, K.: Combinatorial Optimization: Algorithms and Complexity. Dover, New York (1988). https:\/\/doi.org\/10.1109\/TASSP.1984.1164450"},{"key":"24_CR18","volume-title":"Combinatorial Optimization: Poluhedra and Efficiency","author":"A Schrijver","year":"2003","unstructured":"Schrijver, A.: Combinatorial Optimization: Poluhedra and Efficiency. Springer, Dordrecht (2003)"}],"container-title":["Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering","Simulation Tools and Techniques"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-72792-5_24","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,26]],"date-time":"2021-04-26T22:01:35Z","timestamp":1619474495000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-72792-5_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030727918","9783030727925"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-72792-5_24","relation":{},"ISSN":["1867-8211","1867-822X"],"issn-type":[{"type":"print","value":"1867-8211"},{"type":"electronic","value":"1867-822X"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"27 April 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SIMUtools","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Simulation Tools and Techniques","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Guiyang","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":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28 August 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 August 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"simutools2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/simutools.eai-conferences.org\/2020\/","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":"Confy +","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"354","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":"125","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":"35% - 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)"}},{"value":"Due to COVID 19 pandemic the conference was held virtually.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}