{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T16:33:33Z","timestamp":1742920413995,"version":"3.40.3"},"publisher-location":"Cham","reference-count":31,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319784540"},{"type":"electronic","value":"9783319784557"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/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-78455-7_4","type":"book-chapter","created":{"date-parts":[[2018,3,20]],"date-time":"2018-03-20T08:53:10Z","timestamp":1521535990000},"page":"43-53","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["On the Minmax Regret Path Center Problem on Trees"],"prefix":"10.1007","author":[{"given":"Biing-Feng","family":"Wang","sequence":"first","affiliation":[]},{"given":"Jhih-Hong","family":"Ye","sequence":"additional","affiliation":[]},{"given":"Chih-Yu","family":"Li","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,3,21]]},"reference":[{"key":"4_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1007\/3-540-45022-X_8","volume-title":"Automata, Languages and Programming","author":"S Alstrup","year":"2000","unstructured":"Alstrup, S., Holm, J.: Improved algorithms for finding level ancestors in dynamic trees. In: Montanari, U., Rolim, J.D.P., Welzl, E. (eds.) ICALP 2000. LNCS, vol. 1853, pp. 73\u201384. Springer, Heidelberg (2000). https:\/\/doi.org\/10.1007\/3-540-45022-X_8"},{"key":"4_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1007\/3-540-63307-3_47","volume-title":"Algorithms and Data Structures","author":"S Alstrup","year":"1997","unstructured":"Alstrup, S., Lauridsen, Peter W., Sommerlund, P., Thorup, M.: Finding cores of limited length. In: Dehne, F., Rau-Chaplin, A., Sack, J.-R., Tamassia, R. (eds.) WADS 1997. LNCS, vol. 1272, pp. 45\u201354. Springer, Heidelberg (1997). https:\/\/doi.org\/10.1007\/3-540-63307-3_47"},{"issue":"4","key":"4_CR3","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1016\/S0966-8349(98)00033-3","volume":"5","author":"I Averbakh","year":"1997","unstructured":"Averbakh, I., Berman, O.: Minimax regret p-center location on a network with demand uncertainty. Locat. Sci. 5(4), 247\u2013254 (1997)","journal-title":"Locat. Sci."},{"issue":"2","key":"4_CR4","doi-asserted-by":"publisher","first-page":"104","DOI":"10.1287\/ijoc.12.2.104.11897","volume":"12","author":"I Averbakh","year":"2000","unstructured":"Averbakh, I., Berman, O.: Minmax regret median location on a network under uncertainty. INFORMS J. Comput. 12(2), 104\u2013110 (2000)","journal-title":"INFORMS J. Comput."},{"issue":"1","key":"4_CR5","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1007\/s00453-013-9851-7","volume":"70","author":"B Bhattacharya","year":"2014","unstructured":"Bhattacharya, B., Kameda, T., Song, Z.: A linear time algorithm for computing minmax regret 1-median on a tree network. Algorithmica 70(1), 2\u201321 (2014)","journal-title":"Algorithmica"},{"key":"4_CR6","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1016\/j.dam.2014.10.022","volume":"195","author":"B Bhattacharya","year":"2015","unstructured":"Bhattacharya, B., Kameda, T., Song, Z.: Minmax regret 1-center algorithms for path\/tree\/unicycle\/cactus networks. Discrete Appl. Math. 195, 18\u201330 (2015)","journal-title":"Discrete Appl. Math."},{"issue":"4","key":"4_CR7","doi-asserted-by":"publisher","first-page":"601","DOI":"10.1007\/s00453-007-9157-8","volume":"55","author":"B Bhattacharya","year":"2009","unstructured":"Bhattacharya, B., Shi, Q., Tamir, A.: Optimal algorithms for the path\/tree-shaped facility location problems in trees. Algorithmica 55(4), 601\u2013618 (2009)","journal-title":"Algorithmica"},{"issue":"3","key":"4_CR8","doi-asserted-by":"publisher","first-page":"1025","DOI":"10.1016\/j.ejor.2005.11.040","volume":"179","author":"E Conde","year":"2007","unstructured":"Conde, E.: Minmax regret location\u2013allocation problem on a network under uncertainty. Eur. J. Oper. Res. 179(3), 1025\u20131039 (2007)","journal-title":"Eur. J. Oper. Res."},{"issue":"2","key":"4_CR9","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1016\/j.orl.2007.05.009","volume":"36","author":"E Conde","year":"2008","unstructured":"Conde, E.: A note on the minmax regret centdian location on trees. Oper. Res. Lett. 36(2), 271\u2013275 (2008)","journal-title":"Oper. Res. Lett."},{"key":"4_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"327","DOI":"10.1007\/3-540-54233-7_145","volume-title":"Automata, Languages and Programming","author":"HN Djidjev","year":"1991","unstructured":"Djidjev, H.N., Pantziou, G.E., Zaroliagis, C.D.: Computing shortest paths and distances in planar graphs. In: Albert, J.L., Monien, B., Artalejo, M.R. (eds.) ICALP 1991. LNCS, vol. 510, pp. 327\u2013338. Springer, Heidelberg (1991). https:\/\/doi.org\/10.1007\/3-540-54233-7_145"},{"issue":"2","key":"4_CR11","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1002\/nav.3800320203","volume":"32","author":"Z Drezner","year":"1985","unstructured":"Drezner, Z.: Sensitivity analysis of the optimal location of a facility. Naval Res. Logist. Q. 32(2), 209\u2013224 (1985)","journal-title":"Naval Res. Logist. Q."},{"issue":"3","key":"4_CR12","doi-asserted-by":"publisher","first-page":"409","DOI":"10.1287\/opre.14.3.409","volume":"14","author":"H Frank","year":"1966","unstructured":"Frank, H.: Optimum locations on a graph with probabilistic demands. Oper. Res. 14(3), 409\u2013421 (1966)","journal-title":"Oper. Res."},{"issue":"2","key":"4_CR13","doi-asserted-by":"publisher","first-page":"338","DOI":"10.1137\/0213024","volume":"13","author":"D Harel","year":"1984","unstructured":"Harel, D., Tarjan, R.: Fast algorithms for finding nearest common ancestors. SlAM J. Comput. 13(2), 338\u2013355 (1984)","journal-title":"SlAM J. Comput."},{"issue":"3","key":"4_CR14","doi-asserted-by":"publisher","first-page":"513","DOI":"10.1137\/0137040","volume":"37","author":"O Kariv","year":"1979","unstructured":"Kariv, O., Hakimi, S.L.: An algorithmic approach to network location problems. I: the p-centers. SIAM J. Appl. Math. 37(3), 513\u2013538 (1979)","journal-title":"SIAM J. Appl. Math."},{"issue":"3","key":"4_CR15","doi-asserted-by":"publisher","first-page":"539","DOI":"10.1137\/0137041","volume":"37","author":"O Kariv","year":"1979","unstructured":"Kariv, O., Hakimi, S.L.: An algorithmic approach to network location problems. II: the p-medians. SIAM J. Appl. Math. 37(3), 539\u2013560 (1979)","journal-title":"SIAM J. Appl. Math."},{"key":"4_CR16","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4757-2620-6","volume-title":"Robust Discrete Optimization and Its Applications","author":"P Kouvelis","year":"2013","unstructured":"Kouvelis, P., Yu, G.: Robust Discrete Optimization and Its Applications. Springer, New York (2013). https:\/\/doi.org\/10.1007\/978-1-4757-2620-6"},{"issue":"6","key":"4_CR17","doi-asserted-by":"publisher","first-page":"961","DOI":"10.1287\/opre.39.6.961","volume":"39","author":"M Labb\u00e9","year":"1991","unstructured":"Labb\u00e9, M., Thisse, J.-F., Wendell, R.E.: Sensitivity analysis in minisum facility location problems. Oper. Res. 39(6), 961\u2013969 (1991)","journal-title":"Oper. Res."},{"issue":"3","key":"4_CR18","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1002\/net.3230150304","volume":"15","author":"E Minieka","year":"1985","unstructured":"Minieka, E.: The optimal location of a path or tree in a tree network. Networks 15(3), 309\u2013321 (1985)","journal-title":"Networks"},{"issue":"2","key":"4_CR19","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1287\/trsc.13.2.85","volume":"13","author":"PB Mirchandani","year":"1979","unstructured":"Mirchandani, P.B., Odoni, A.R.: Locations of medians on stochastic networks. Transp. Sci. 13(2), 85\u201397 (1979)","journal-title":"Transp. Sci."},{"issue":"3","key":"4_CR20","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1016\/0196-6774(80)90012-7","volume":"1","author":"CA Morgan","year":"1980","unstructured":"Morgan, C.A., Slater, P.J.: A linear algorithm for a core of a tree. J. Algorithms 1(3), 247\u2013258 (1980)","journal-title":"J. Algorithms"},{"issue":"2","key":"4_CR21","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1002\/net.20453","volume":"58","author":"J Puerto","year":"2011","unstructured":"Puerto, J., Ricca, F., Scozzari, A.: Minimax regret path location on trees. Networks 58(2), 147\u2013158 (2011)","journal-title":"Networks"},{"issue":"4","key":"4_CR22","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1002\/net.20112","volume":"47","author":"J Puerto","year":"2006","unstructured":"Puerto, J., Rodr\u00edguez-Ch\u00eda, A.M., Tamir, A., P\u00e9rez-Brito, D.: The bi-criteria doubly weighted center-median path problem on a tree. Networks 47(4), 237\u2013247 (2006)","journal-title":"Networks"},{"issue":"7","key":"4_CR23","doi-asserted-by":"publisher","first-page":"547","DOI":"10.1080\/07408170500216480","volume":"38","author":"L Synder","year":"2006","unstructured":"Synder, L.: Facility location under uncertainty: a review. IIE Trans. 38(7), 547\u2013564 (2006)","journal-title":"IIE Trans."},{"issue":"2","key":"4_CR24","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1016\/0167-6377(96)00021-1","volume":"19","author":"A Tamir","year":"1996","unstructured":"Tamir, A.: An O(pn\n          2) algorithm for the p-median and related problems on tree graphs. Oper. Res. Lett. 19(2), 59\u201364 (1996)","journal-title":"Oper. Res. Lett."},{"issue":"3","key":"4_CR25","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1016\/j.orl.2003.10.004","volume":"32","author":"A Tamir","year":"2004","unstructured":"Tamir, A.: Sorting weighted distances with applications to objective function evaluations in single facility location problems. Oper. Res. Lett. 32(3), 249\u2013257 (2004)","journal-title":"Oper. Res. Lett."},{"issue":"1","key":"4_CR26","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1016\/j.jalgor.2005.01.005","volume":"56","author":"A Tamir","year":"2005","unstructured":"Tamir, A., Puerto, J., Mesa, J.A., Rodr\u00edguez-Ch\u00eda, A.M.: Conditional location of path and tree shaped facilities on trees. J. Algorithms 56(1), 50\u201375 (2005)","journal-title":"J. Algorithms"},{"issue":"3","key":"4_CR27","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1016\/S0166-218X(01)00199-8","volume":"118","author":"A Tamir","year":"2002","unstructured":"Tamir, A., Puerto, J., P\u00e9rez-Brito, D.: The centdian subtree on tree networks. Discrete Appl. Math. 118(3), 263\u2013278 (2002)","journal-title":"Discrete Appl. Math."},{"issue":"1","key":"4_CR28","doi-asserted-by":"publisher","first-page":"90","DOI":"10.1006\/jagm.1999.1020","volume":"34","author":"B-F Wang","year":"2000","unstructured":"Wang, B.-F.: Efficient parallel algorithms for optimally locating a path and a tree of a specified length in a weighted tree network. J. Algorithms 34(1), 90\u2013108 (2000)","journal-title":"J. Algorithms"},{"key":"4_CR29","unstructured":"Ye, J.-H., Li, C.-Y., Wang, B.-F.: An improved algorithm for the minmax regret path centdian problem on trees. Submitted to journal for publication, under revision"},{"issue":"7","key":"4_CR30","doi-asserted-by":"publisher","first-page":"1159","DOI":"10.1016\/j.jcss.2015.01.002","volume":"81","author":"J-H Ye","year":"2015","unstructured":"Ye, J.-H., Wang, B.-F.: On the minmax regret path median problem on trees. J. Comput. Syst. Sci. 81(7), 1159\u20131170 (2015)","journal-title":"J. Comput. Syst. Sci."},{"issue":"3","key":"4_CR31","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1367064.1367076","volume":"4","author":"H-I Yu","year":"2008","unstructured":"Yu, H.-I., Lin, T.-C., Wang, B.-F.: Improved algorithms for the minmax-regret 1-center and 1-median problems. ACM Trans. Algorithms 4(3), 1\u201327 (2008)","journal-title":"ACM Trans. Algorithms"}],"container-title":["Lecture Notes in Computer Science","Frontiers in Algorithmics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-78455-7_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,7]],"date-time":"2024-03-07T11:29:10Z","timestamp":1709810950000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-78455-7_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319784540","9783319784557"],"references-count":31,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-78455-7_4","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":"21 March 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"FAW","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Frontiers in Algorithmics","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Guangzhou","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":"8 May 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 May 2018","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":"faw2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/itcs.shufe.edu.cn\/faw2018\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}