{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T00:04:51Z","timestamp":1742947491229,"version":"3.40.3"},"publisher-location":"Cham","reference-count":26,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031491894"},{"type":"electronic","value":"9783031491900"}],"license":[{"start":{"date-parts":[[2023,12,9]],"date-time":"2023-12-09T00:00:00Z","timestamp":1702080000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,12,9]],"date-time":"2023-12-09T00:00:00Z","timestamp":1702080000000},"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-49190-0_7","type":"book-chapter","created":{"date-parts":[[2023,12,8]],"date-time":"2023-12-08T09:02:36Z","timestamp":1702026156000},"page":"97-111","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Hardness and\u00a0Approximation for\u00a0the\u00a0Star $$\\beta $$-Hub Routing Cost Problem in\u00a0$$\\varDelta _\\beta $$-Metric Graphs"],"prefix":"10.1007","author":[{"given":"Meng-Shiou","family":"Tsai","sequence":"first","affiliation":[]},{"given":"Sun-Yuan","family":"Hsieh","sequence":"additional","affiliation":[]},{"given":"Ling-Ju","family":"Hung","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,12,9]]},"reference":[{"issue":"10","key":"7_CR1","doi-asserted-by":"publisher","first-page":"1349","DOI":"10.1057\/jors.2008.92","volume":"60","author":"S Alumur","year":"2009","unstructured":"Alumur, S., Kara, B.Y.: A hub covering network design problem for cargo applications in Turkey. J. Oper. Res. Soc. 60(10), 1349\u20131359 (2009)","journal-title":"J. Oper. Res. Soc."},{"issue":"1","key":"7_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.ejor.2007.06.008","volume":"190","author":"S Alumur","year":"2008","unstructured":"Alumur, S., Kara, B.Y.: Network hub location problems: the state of the art. Eur. J. Oper. Res. 190(1), 1\u201321 (2008)","journal-title":"Eur. J. Oper. Res."},{"key":"7_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1057\/palgrave.mel.9100121","volume":"7","author":"R Aversa","year":"2005","unstructured":"Aversa, R., Botter, R.C., Haralambides, H., Yoshizaki, H.: A mixed integer programming model on the location of a hub port in the east coast of south America. Marit. Econ. Logist. 7, 1\u201318 (2005)","journal-title":"Marit. Econ. Logist."},{"key":"7_CR4","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1016\/j.apm.2017.09.032","volume":"54","author":"M Bashiri","year":"2018","unstructured":"Bashiri, M., Rezanezhad, M., Tavakkoli-Moghaddam, R., Hasanzadeh, H.: Mathematical modeling for a p-mobile hub location problem in a dynamic environment by a genetic algorithm. Appl. Math. Model. 54, 151\u2013169 (2018)","journal-title":"Appl. Math. Model."},{"key":"7_CR5","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1016\/S0020-0190(00)00089-2","volume":"75","author":"HJ B\u00f6ckenhauer","year":"2000","unstructured":"B\u00f6ckenhauer, H.J., Hromkovi\u010d, J., Klasing, R., Seibert, S., Unger, W.: Approximation algorithms for the tsp with sharpened triangle inequality. Inf. Process. Lett. 75, 133\u2013138 (2000)","journal-title":"Inf. Process. Lett."},{"key":"7_CR6","doi-asserted-by":"publisher","first-page":"92","DOI":"10.1016\/j.jcss.2017.09.012","volume":"92","author":"L-H Chen","year":"2018","unstructured":"Chen, L.-H., et al.: Approximability and inapproximability of the star p-hub center problem with parameterized triangle inequality. J. Comput. Syst. Sci. 92, 92\u2013112 (2018)","journal-title":"J. Comput. Syst. Sci."},{"key":"7_CR7","unstructured":"Chen, L.-H., Cheng, D.-W., Hsieh, S.-Y., Hung, L.-J., Lee, C.-W., Wu, B.-Y.: Approximation algorithms for single allocation k-hub center problem. In: Proceedings of the 33rd Workshop on Combinatorial Mathematics and Computation Theory (CMCT 2016), pp. 13\u201318 (2016)"},{"key":"7_CR8","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1016\/j.tcs.2019.05.008","volume":"806","author":"L-H Chen","year":"2020","unstructured":"Chen, L.-H., Hsieh, S.-Y., Hung, L.-J., Klasing, R.: Approximation algorithms for the $$p$$-hub center routing problem in parameterized metric graphs. Theoret. Comput. Sci. 806, 271\u2013280 (2020)","journal-title":"Theoret. Comput. Sci."},{"key":"7_CR9","doi-asserted-by":"publisher","first-page":"1993","DOI":"10.1007\/s00453-022-00941-z","volume":"84","author":"L-H Chen","year":"2022","unstructured":"Chen, L.-H., Hsieh, S.-Y., Hung, L.-J., Klasing, R.: On the approximability of the single allocation $$p$$-hub center problem with parameterized triangle inequality. Algorithmica 84, 1993\u20132027 (2022)","journal-title":"Algorithmica"},{"key":"7_CR10","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2023.106241","volume":"155","author":"I Espejo","year":"2023","unstructured":"Espejo, I., Mar\u00edn, A., Mu\u00f1oz-Oca\u00f1a, J.M., Rodr\u00edguez-Ch\u00eda, A.M.: A new formulation and branch-and-cut method for single-allocation hub location problems. Comput. Oper. Res. 155, 106241 (2023)","journal-title":"Comput. Oper. Res."},{"issue":"4","key":"7_CR11","doi-asserted-by":"publisher","first-page":"1096","DOI":"10.1016\/j.cie.2013.01.012","volume":"64","author":"RZ Farahani","year":"2013","unstructured":"Farahani, R.Z., Hekmatfar, M., Arabani, A.B., Nikbakhsh, E.: Hub location problems: a review of models, classification, solution techniques, and applications. Comput. Ind. Eng. 64(4), 1096\u20131109 (2013)","journal-title":"Comput. Ind. Eng."},{"key":"7_CR12","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2022.105851","volume":"145","author":"N Ghaffarinasab","year":"2022","unstructured":"Ghaffarinasab, N.: Stochastic hub location problems with Bernoulli demands. Comput. Oper. Res. 145, 105851 (2022)","journal-title":"Comput. Oper. Res."},{"issue":"01","key":"7_CR13","doi-asserted-by":"publisher","first-page":"1940005","DOI":"10.1142\/S021926591940005X","volume":"19","author":"S-Y Hsieh","year":"2019","unstructured":"Hsieh, S.-Y., Kao, S.-S.: A survey of hub location problems. J. Interconnect. Netw. 19(01), 1940005 (2019)","journal-title":"J. Interconnect. Netw."},{"key":"7_CR14","doi-asserted-by":"publisher","first-page":"2078","DOI":"10.1016\/j.dam.2008.11.016","volume":"157","author":"M Iwasa","year":"2009","unstructured":"Iwasa, M., Saito, H., Matsui, T.: Approximation algorithms for the single allocation problem in hub-and-spoke networks and related metric labeling problems. Discret. Appl. Math. 157, 2078\u20132088 (2009)","journal-title":"Discret. Appl. Math."},{"key":"7_CR15","doi-asserted-by":"publisher","first-page":"138","DOI":"10.1016\/j.orl.2012.12.007","volume":"41","author":"H Liang","year":"2013","unstructured":"Liang, H.: The hardness and approximation of the star p-hub center problem. Oper. Res. Lett. 41, 138\u2013141 (2013)","journal-title":"Oper. Res. Lett."},{"key":"7_CR16","doi-asserted-by":"publisher","first-page":"477","DOI":"10.1016\/j.cie.2018.12.058","volume":"128","author":"A L\u00fcer-Villagra","year":"2019","unstructured":"L\u00fcer-Villagra, A., Eiselt, H., Marianov, V.: A single allocation $$p$$-hub median problem with general piecewise-linear costs in arcs. Comput. Ind. Eng. 128, 477\u2013491 (2019)","journal-title":"Comput. Ind. Eng."},{"key":"7_CR17","doi-asserted-by":"publisher","first-page":"375","DOI":"10.1016\/j.cor.2018.09.006","volume":"104","author":"H Mokhtar","year":"2019","unstructured":"Mokhtar, H., Krishnamoorthy, M., Ernst, A.T.: The 2-allocation p-hub median problem and a modified benders decomposition method for solving hub location problems. Comput. Oper. Res. 104, 375\u2013393 (2019)","journal-title":"Comput. Oper. Res."},{"key":"7_CR18","doi-asserted-by":"crossref","unstructured":"O\u2019kelly, M.E.: A quadratic integer program for the location of interacting hub facilities. Eur. J. Oper. Res. 32, 393\u2013404 (1987)","DOI":"10.1016\/S0377-2217(87)80007-3"},{"key":"7_CR19","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2022.105715","volume":"142","author":"FA Oliveira","year":"2022","unstructured":"Oliveira, F.A., de S\u00e1, E.M., de Souza, S.R.: Benders decomposition applied to profit maximizing hub location problem with incomplete hub network. Comput. Oper. Res. 142, 105715 (2022)","journal-title":"Comput. Oper. Res."},{"issue":"5","key":"7_CR20","doi-asserted-by":"publisher","first-page":"495","DOI":"10.1016\/j.tre.2006.01.005","volume":"43","author":"V Rodr\u00edguez","year":"2007","unstructured":"Rodr\u00edguez, V., Alvarez, M., Barcos, L.: Hub location under capacity constraints. Transp. Res. Part E: Logist. Transp. Rev. 43(5), 495\u2013505 (2007)","journal-title":"Transp. Res. Part E: Logist. Transp. Rev."},{"key":"7_CR21","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2021.107563","volume":"160","author":"A Sharma","year":"2021","unstructured":"Sharma, A., Kohar, A., Jakhar, S.K.: Sonia: profit maximizing hub location problem in the airline industry under coopetition. Comput. Ind. Eng. 160, 107563 (2021)","journal-title":"Comput. Ind. Eng."},{"issue":"2","key":"7_CR22","doi-asserted-by":"publisher","first-page":"412","DOI":"10.1016\/j.ejor.2019.02.056","volume":"277","author":"B Soylu","year":"2019","unstructured":"Soylu, B., Katip, H.: A multiobjective hub-airport location problem for an airline network design. Eur. J. Oper. Res. 277(2), 412\u2013425 (2019)","journal-title":"Eur. J. Oper. Res."},{"key":"7_CR23","doi-asserted-by":"publisher","DOI":"10.1016\/j.seps.2023.101563","volume":"87","author":"C Wang","year":"2023","unstructured":"Wang, C., Liu, Y., Yang, G.: Adaptive distributionally robust hub location and routing problem with a third-party logistics strategy. Socioecon. Plann. Sci. 87, 101563 (2023)","journal-title":"Socioecon. Plann. Sci."},{"issue":"11","key":"7_CR24","doi-asserted-by":"publisher","first-page":"2725","DOI":"10.1016\/j.cor.2012.02.005","volume":"39","author":"H Yaman","year":"2012","unstructured":"Yaman, H., Elloumi, S.: Star $$p$$-hub center problem and star p-hub median problem with bounded path lengths. Comput. Oper. Res. 39(11), 2725\u20132732 (2012)","journal-title":"Comput. Oper. Res."},{"key":"7_CR25","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1016\/j.tcs.2022.04.007","volume":"922","author":"H-P Yeh","year":"2022","unstructured":"Yeh, H.-P., Wei, L., Chen, L.-H., Hung, L.-J., Klasing, R., Hsieh, S.-Y.: Hardness and approximation for the star $$p$$-hub routing cost problem in metric graphs. Theoret. Comput. Sci. 922, 13\u201324 (2022)","journal-title":"Theoret. Comput. Sci."},{"key":"7_CR26","doi-asserted-by":"publisher","first-page":"668","DOI":"10.1016\/j.apm.2019.04.056","volume":"74","author":"F Yin","year":"2019","unstructured":"Yin, F., Chen, Y., Song, F., Liu, Y.: A new distributionally robust $$p$$-hub median problem with uncertain carbon emissions and its tractable approximation method. Appl. Math. Model. 74, 668\u2013693 (2019)","journal-title":"Appl. Math. Model."}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-49190-0_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,12,8]],"date-time":"2023-12-08T09:08:51Z","timestamp":1702026531000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-49190-0_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,12,9]]},"ISBN":["9783031491894","9783031491900"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-49190-0_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023,12,9]]},"assertion":[{"value":"9 December 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"COCOON","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Computing and Combinatorics Conference","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Hawaii, HI","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 December 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 December 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cocoon2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/theory.utdallas.edu\/COCOON2023\/org.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":"Springer EquinOCS","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"146","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":"60","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":"41% - 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":"6","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)"}}]}}