{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T11:16:40Z","timestamp":1725880600829},"publisher-location":"Cham","reference-count":31,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319539249"},{"type":"electronic","value":"9783319539256"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-53925-6_31","type":"book-chapter","created":{"date-parts":[[2017,2,20]],"date-time":"2017-02-20T01:12:36Z","timestamp":1487553156000},"page":"397-408","source":"Crossref","is-referenced-by-count":0,"title":["Approximation Algorithm for Cycle-Star Hub Network Design Problems and Cycle-Metric Labeling Problems"],"prefix":"10.1007","author":[{"given":"Yuko","family":"Kuroki","sequence":"first","affiliation":[]},{"given":"Tomomi","family":"Matsui","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,2,21]]},"reference":[{"key":"31_CR1","doi-asserted-by":"crossref","first-page":"1274","DOI":"10.1287\/mnsc.32.10.1274","volume":"32","author":"MP Adams","year":"1986","unstructured":"Adams, M.P., Sherali, H.D.: A tight linearization and an algorithm for zero-one quadratic programming problems. Manage. Sci. 32, 1274\u20131290 (1986)","journal-title":"Manage. Sci."},{"key":"31_CR2","doi-asserted-by":"crossref","first-page":"78","DOI":"10.1137\/S0097539792224474","volume":"24","author":"N Alon","year":"1995","unstructured":"Alon, N., Karp, R.M., Peleg, D., West, D.: A graph-theoretic game and its application to the $$k$$ -server problem. SIAM J. Comput. 24, 78\u2013100 (1995)","journal-title":"SIAM J. Comput."},{"key":"31_CR3","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.ejor.2007.06.008","volume":"190","author":"SA Alumur","year":"2008","unstructured":"Alumur, S.A., Kara, B.Y.: Network hub location problems: the state of the art. Eur. J. Oper. Res. 190, 1\u201321 (2008)","journal-title":"Eur. J. Oper. Res."},{"key":"31_CR4","first-page":"951","volume":"43","author":"SA Alumur","year":"2009","unstructured":"Alumur, S.A., Kara, B.Y., Karasan, O.E.: The design of single allocation incomplete hub networks. Transport. Res. B-Methodol. 43, 951\u2013956 (2009)","journal-title":"Transport. Res. B-Methodol."},{"key":"31_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"474","DOI":"10.1007\/978-3-642-25591-5_49","volume-title":"Algorithms and Computation","author":"R Ando","year":"2011","unstructured":"Ando, R., Matsui, T.: Algorithm for single allocation problem on hub-and-spoke networks in 2-dimensional plane. In: Asano, T., Nakano, S., Okamoto, Y., Watanabe, O. (eds.) ISAAC 2011. LNCS, vol. 7074, pp. 474\u2013483. Springer, Heidelberg (2011). doi: 10.1007\/978-3-642-25591-5_49"},{"key":"31_CR6","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1016\/0166-218X(93)E0121-E","volume":"58","author":"WW Bein","year":"1995","unstructured":"Bein, W.W., Brucker, P., Park, J.K., Pathak, P.K.: A Monge property for the $$d$$ -dimensional transportation problem. Discret. Appl. Math. 58, 97\u2013109 (1995)","journal-title":"Discret. Appl. Math."},{"key":"31_CR7","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1016\/0166-218X(95)00103-X","volume":"70","author":"RE Burkard","year":"1996","unstructured":"Burkard, R.E., Klinz, B., Rudolf, R.: Perspectives of Monge properties in optimization. Discret. Appl. Math. 70, 95\u2013161 (1996)","journal-title":"Discret. Appl. Math."},{"key":"31_CR8","doi-asserted-by":"crossref","first-page":"3088","DOI":"10.1016\/j.cor.2008.11.023","volume":"36","author":"H Calik","year":"2009","unstructured":"Calik, H., Alumur, S.A., Kara, B.Y., Karasan, O.E.: A tabu-search based heuristic for the hub covering problem over incomplete hub networks. Comput. Oper. Res. 36, 3088\u20133096 (2009)","journal-title":"Comput. Oper. Res."},{"key":"31_CR9","first-page":"31","volume":"6","author":"JF Campbell","year":"1994","unstructured":"Campbell, J.F.: A survey of network hub location. Stud. Locat. Anal. 6, 31\u201347 (1994)","journal-title":"Stud. Locat. Anal."},{"key":"31_CR10","doi-asserted-by":"crossref","first-page":"1540","DOI":"10.1287\/mnsc.1050.0406","volume":"51","author":"JF Campbell","year":"2005","unstructured":"Campbell, J.F., Ernst, A.T., Krishnamoorthy, M.: Hub arc location problems: part I: introduction and results. Manage. Sci. 51, 1540\u20131555 (2005)","journal-title":"Manage. Sci."},{"key":"31_CR11","doi-asserted-by":"crossref","first-page":"1556","DOI":"10.1287\/mnsc.1050.0407","volume":"51","author":"JF Campbell","year":"2005","unstructured":"Campbell, J.F., Ernst, A.T., Krishnamoorthy, M.: Hub arc location problems: part II: formulations and optimal Algorithms. Manage. Sci. 51, 1556\u20131571 (2005)","journal-title":"Manage. Sci."},{"key":"31_CR12","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1287\/trsc.1120.0410","volume":"46","author":"JF Campbell","year":"2012","unstructured":"Campbell, J.F., O\u2019Kelly, M.E.: Twenty-five years of hub location research. Transport. Sci. 46, 153\u2013169 (2012)","journal-title":"Transport. Sci."},{"key":"31_CR13","doi-asserted-by":"crossref","first-page":"1376","DOI":"10.1137\/06065430X","volume":"36","author":"J Chuzhoy","year":"2007","unstructured":"Chuzhoy, J., Naor, J.: The hardness of metric labeling. SIAM J. Comput. 36, 1376\u20131386 (2007)","journal-title":"SIAM J. Comput."},{"key":"31_CR14","doi-asserted-by":"crossref","first-page":"3117","DOI":"10.1016\/j.cor.2008.12.009","volume":"36","author":"I Contreras","year":"2009","unstructured":"Contreras, I., Fern\u00e1ndez, E., Mar\u00edn, A.: Tight bounds from a path based formulation for the tree of hub location problem. Comput. Oper. Res. 36, 3117\u20133127 (2009)","journal-title":"Comput. Oper. Res."},{"key":"31_CR15","doi-asserted-by":"crossref","first-page":"390","DOI":"10.1016\/j.ejor.2009.05.044","volume":"202","author":"I Contreras","year":"2010","unstructured":"Contreras, I., Fern\u00e1ndez, E., Mar\u00edn, A.: The tree of hubs location problem. Eur. J. Oper. Res. 202, 390\u2013400 (2010)","journal-title":"Eur. J. Oper. Res."},{"key":"31_CR16","doi-asserted-by":"crossref","first-page":"311","DOI":"10.1007\/978-3-319-13111-5_12","volume-title":"Location Science","author":"I Contreras","year":"2015","unstructured":"Contreras, I.: Hub location problems. In: Laporte, G., Nickel, S., Da Gama, F.S. (eds.) Location Science, pp. 311\u2013344. Springer, New York (2015). (Chap. 12)"},{"key":"31_CR17","doi-asserted-by":"publisher","unstructured":"Contreras, I., Tanash, M., Vidyarthi, N.: Exact and heuristic approaches for the cycle hub location problem. Ann. Oper. Res. 1\u201323 (2016). doi: 10.1007\/s10479-015-2091-2","DOI":"10.1007\/s10479-015-2091-2"},{"key":"31_CR18","doi-asserted-by":"crossref","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":"31_CR19","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1016\/0360-8352(92)90005-5","volume":"22","author":"JG Kim","year":"1992","unstructured":"Kim, J.G., Tcha, D.W.: Optimal design of a two-level hierarchical network with tree-star configuration. Comput. Ind. Eng. 22, 273\u2013281 (1992)","journal-title":"Comput. Ind. Eng."},{"key":"31_CR20","doi-asserted-by":"crossref","first-page":"307","DOI":"10.1016\/S0966-8349(98)00042-4","volume":"6","author":"JG Klincewicz","year":"1998","unstructured":"Klincewicz, J.G.: Hub location in backbone\/tributary network design: a review. Locat. Sci. 6, 307\u2013335 (1998)","journal-title":"Locat. Sci."},{"key":"31_CR21","doi-asserted-by":"crossref","first-page":"616","DOI":"10.1145\/585265.585268","volume":"49","author":"J Kleinberg","year":"2002","unstructured":"Kleinberg, J., Tardos, E.: Approximation algorithms for classification problems with pairwise relationships. J. ACM 49, 616\u2013630 (2002)","journal-title":"J. ACM"},{"key":"31_CR22","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1002\/net.20193","volume":"51","author":"M Labb\u00e9","year":"2008","unstructured":"Labb\u00e9, M., Yaman, H.: Solving the hub location problem in a star-star network. Networks 51, 19\u201333 (2008)","journal-title":"Networks"},{"key":"31_CR23","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1016\/j.ejor.2012.10.051","volume":"226","author":"EM S\u00e1 de","year":"2013","unstructured":"de S\u00e1, E.M., de Camargo, R.S., de Miranda, G.: An improved Benders decomposition algorithm for the tree of hubs location problem. Eur. J. Oper. Res. 226, 185\u2013202 (2013)","journal-title":"Eur. J. Oper. Res."},{"key":"31_CR24","doi-asserted-by":"crossref","first-page":"500","DOI":"10.1287\/trsc.2014.0576","volume":"49","author":"E Martins de S\u00e1","year":"2015","unstructured":"Martins de S\u00e1, E., Contreras, I., Cordeau, J.F., de Camargo, R.S., de Miranda, G.: The hub line location problem. Transp. Sci. 49, 500\u2013518 (2015)","journal-title":"Transp. Sci."},{"key":"31_CR25","doi-asserted-by":"crossref","first-page":"393","DOI":"10.1016\/S0377-2217(87)80007-3","volume":"32","author":"ME O\u2019Kelly","year":"1987","unstructured":"O\u2019Kelly, M.E.: A quadratic integer program for the location of interacting hub facilities. Eur. J. Oper. Res. 32, 393\u2013404 (1987)","journal-title":"Eur. J. Oper. Res."},{"key":"31_CR26","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1016\/0966-6923(94)90032-9","volume":"2","author":"ME O\u2019Kelly","year":"1994","unstructured":"O\u2019Kelly, M.E., Miller, H.J.: The hub network design problem: a review and synthesis. J. Transp. Geogr. 2, 31\u201340 (1994)","journal-title":"J. Transp. Geogr."},{"key":"31_CR27","doi-asserted-by":"crossref","first-page":"617","DOI":"10.1016\/S0377-2217(96)00233-0","volume":"100","author":"J Sohn","year":"1997","unstructured":"Sohn, J., Park, S.: A linear program for the two-hub location problem. Eur. J. Oper. Res. 100, 617\u2013622 (1997)","journal-title":"Eur. J. Oper. Res."},{"key":"31_CR28","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1002\/(SICI)1097-0037(200001)35:1<17::AID-NET2>3.0.CO;2-N","volume":"35","author":"J Sohn","year":"2000","unstructured":"Sohn, J., Park, S.: The single allocation problem in the interacting three-hub network. Networks 35, 17\u201325 (2000)","journal-title":"Networks"},{"key":"31_CR29","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1016\/j.disopt.2008.08.003","volume":"6","author":"H Saito","year":"2009","unstructured":"Saito, H., Fujie, T., Matsui, T., Matuura, S.: A study of the quadratic semi-assignment polytope. Discret. Optim. 6, 37\u201350 (2009)","journal-title":"Discret. Optim."},{"key":"31_CR30","doi-asserted-by":"crossref","first-page":"3009","DOI":"10.1016\/j.cor.2007.01.014","volume":"35","author":"H Yaman","year":"2008","unstructured":"Yaman, H.: Star $$p$$ -hub median problem with modular arc capacities. Comput. Oper. Res. 35, 3009\u20133019 (2008)","journal-title":"Comput. Oper. Res."},{"key":"31_CR31","doi-asserted-by":"crossref","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, 2725\u20132732 (2012)","journal-title":"Comput. Oper. Res."}],"container-title":["Lecture Notes in Computer Science","WALCOM: Algorithms and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-53925-6_31","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,8,22]],"date-time":"2023-08-22T08:27:31Z","timestamp":1692692851000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-53925-6_31"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319539249","9783319539256"],"references-count":31,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-53925-6_31","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]}}}