{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:20:18Z","timestamp":1759638018531},"reference-count":23,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2015,6,27]],"date-time":"2015-06-27T00:00:00Z","timestamp":1435363200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Optim Lett"],"published-print":{"date-parts":[[2016,8]]},"DOI":"10.1007\/s11590-015-0912-5","type":"journal-article","created":{"date-parts":[[2015,6,26]],"date-time":"2015-06-26T03:26:36Z","timestamp":1435289196000},"page":"1191-1201","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["The connected p-median problem on block graphs"],"prefix":"10.1007","volume":"10","author":[{"given":"Shun-Chieh","family":"Chang","sequence":"first","affiliation":[]},{"given":"William Chung-Kung","family":"Yen","sequence":"additional","affiliation":[]},{"given":"Yue-Li","family":"Wang","sequence":"additional","affiliation":[]},{"given":"Jia-Jie","family":"Liu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,6,27]]},"reference":[{"key":"912_CR1","doi-asserted-by":"crossref","first-page":"448","DOI":"10.1016\/S0022-0000(73)80033-9","volume":"7","author":"M Blum","year":"1972","unstructured":"Blum, M., Floyd, R.W., Pratt, V.R., Rivest, R.L., Tarjan, R.E.: Time bounds for selection. J. Comput. Syst. Sci. 7, 448\u2013461 (1972)","journal-title":"J. Comput. Syst. Sci."},{"key":"912_CR2","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1007\/s00186-006-0121-1","volume":"65","author":"RE Burkard","year":"2007","unstructured":"Burkard, R.E., Fathali, J.: A polynomial method for the pos\/neg weighted 3-median problem on a tree. Math. Method Oper. Res. 65, 229\u2013238 (2007)","journal-title":"Math. Method Oper. Res."},{"key":"912_CR3","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1007\/s10878-008-9187-4","volume":"20","author":"RE Burkard","year":"2008","unstructured":"Burkard, R.E., Hatzl, J.: Median problems with positive and negative weights on cycles and cacti. J. Comb. Optim. 20, 27\u201346 (2008)","journal-title":"J. Comb. Optim."},{"key":"912_CR4","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1007\/BF02684332","volume":"60","author":"RE Burkard","year":"1998","unstructured":"Burkard, R.E., Krarup, J.: A linear algorithm for the pos\/neg-weighted 1-median problem on a cactus. Computing 60, 193\u2013215 (1998)","journal-title":"Computing"},{"key":"912_CR5","first-page":"271","volume":"3669","author":"R Benkoczi","year":"2005","unstructured":"Benkoczi, R., Bhattacharya, B.: A new template for solving $$p$$ p -median problems for trees in sub-quadratic time. LNCS 3669, 271\u2013282 (2005)","journal-title":"LNCS"},{"key":"912_CR6","first-page":"83","volume":"40","author":"SC Chang","year":"2013","unstructured":"Chang, S.C., Yen, C.K., Wang, Y.L., Liu, J.J.: The NP-hardness of the connected $$p$$ p -median problem on bipartite graphs and split graphs. Chiang Mai J. Sci. 40, 83\u201388 (2013)","journal-title":"Chiang Mai J. Sci."},{"key":"912_CR7","first-page":"89","volume":"29","author":"GT Chen","year":"2009","unstructured":"Chen, G.T., Ding, W., Li, S.W.: Connected $$p$$ p -median problems in tree networks. J. Hangzhou Dianzi Univ. 29, 89\u201391 (2009)","journal-title":"J. Hangzhou Dianzi Univ."},{"key":"912_CR8","first-page":"77","volume":"30","author":"GT Chen","year":"2010","unstructured":"Chen, G.T., Xin, S., Cui, S.H.: The connected $$p$$ p -median problem on the 3-cactus graph. J. Hangzhou Dianzi Univ. 30, 77\u201380 (2010)","journal-title":"J. Hangzhou Dianzi Univ."},{"key":"912_CR9","doi-asserted-by":"crossref","first-page":"1038","DOI":"10.1016\/j.tcs.2009.11.009","volume":"411","author":"YK Cheng","year":"2010","unstructured":"Cheng, Y.K., Kang, L.Y., Lu, C.H.: The pos\/neg-weighted $$1$$ 1 -median problem on tree graphs with subtree-shaped customers. Theor. Comput. Sci. 411, 1038\u20131044 (2010)","journal-title":"Theor. Comput. Sci."},{"key":"912_CR10","doi-asserted-by":"crossref","DOI":"10.1002\/9781118032343","volume-title":"Networks and Discrete Location, Models, Algorithms, and Applications","author":"MS Daskin","year":"1995","unstructured":"Daskin, M.S.: Networks and Discrete Location, Models, Algorithms, and Applications. Wiley, New York (1995)"},{"key":"912_CR11","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-56082-8","volume-title":"Facility Location: Applications and Theory","author":"Z Drezner","year":"2002","unstructured":"Drezner, Z., Hamacher, H.: Facility Location: Applications and Theory. Springer, Heidelberg (2002)"},{"key":"912_CR12","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"MR Garey","year":"1978","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman & Co., New York (1978)"},{"key":"912_CR13","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1002\/net.3230260413","volume":"26","author":"B Gavsih","year":"1995","unstructured":"Gavsih, B., Sridhar, S.: Computing the 2-median on tree networks in $$O(n\\log n)$$ O ( n log n ) time. Networks 26, 305\u2013317 (1995)","journal-title":"Networks"},{"key":"912_CR14","doi-asserted-by":"crossref","first-page":"212","DOI":"10.1287\/trsc.5.2.212","volume":"5","author":"AJ Goldman","year":"1971","unstructured":"Goldman, A.J.: Optimal center location in simple networks. Transport. Sci. 5, 212\u2013221 (1971)","journal-title":"Transport. Sci."},{"key":"912_CR15","doi-asserted-by":"crossref","first-page":"377","DOI":"10.1007\/s00607-007-0238-y","volume":"80","author":"J Hatzl","year":"2007","unstructured":"Hatzl, J.: Median problem on wheels and cactus graphs. Computing 80, 377\u2013393 (2007)","journal-title":"Computing"},{"key":"912_CR16","doi-asserted-by":"crossref","first-page":"539","DOI":"10.1137\/0137041","volume":"27","author":"O Kariv","year":"1979","unstructured":"Kariv, O., Hakimi, S.L.: An algorithmic approach to network location problems, part II: $$p$$ p -medians. SIAM J. Appl. Math. 27, 539\u2013560 (1979)","journal-title":"SIAM J. Appl. Math."},{"key":"912_CR17","doi-asserted-by":"crossref","first-page":"602","DOI":"10.1016\/S0377-2217(99)00080-6","volume":"122","author":"YF Lan","year":"2000","unstructured":"Lan, Y.F., Wang, Y.L.: An optimal algorithm for solving the 1-median problem on weighted 4-cactus graphs. Eur. J. Oper. Res. 122, 602\u2013610 (2000)","journal-title":"Eur. J. Oper. Res."},{"key":"912_CR18","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1002\/net.20128","volume":"48","author":"J Reese","year":"2006","unstructured":"Reese, J.: Solution methods for the $$p$$ p -median problem: an annotated bibliography. Networks 48, 125\u2013142 (2006)","journal-title":"Networks"},{"key":"912_CR19","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1016\/0167-6377(96)00021-1","volume":"19","author":"A Tamir","year":"1996","unstructured":"Tamir, A.: An $$O(pn^2)$$ O ( p n 2 ) algorithm for the $$p$$ p -median and related problems on tree graphs. Oper. Res. Lett. 19, 59\u201364 (1996)","journal-title":"Oper. Res. Lett."},{"key":"912_CR20","unstructured":"Vieira, C.E.C.: Heuristics for the Connected $$p$$ p -Median Problem, Ph.D. Thesis, Pontif\u00edcia Universidade Cat\u00f3lica do Rio de Janeiro (2006)"},{"key":"912_CR21","volume-title":"Introduction to Graph Theory","author":"DB West","year":"2001","unstructured":"West, D.B.: Introduction to Graph Theory, 2nd edn. Prentice-Hall, Upper Saddle River (2001)","edition":"2"},{"key":"912_CR22","doi-asserted-by":"crossref","unstructured":"Yang, B.H., Fang, Z.G., Zhao, J.S., Ye, S.Y.: The location problem in emergency management considering uncertain information. In: Proceedings of 2009 IEEE International Conference on Grey Systems and Intelligent Services, pp. 10\u201312 (2009)","DOI":"10.1109\/GSIS.2009.5408187"},{"key":"912_CR23","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1007\/s00607-010-0084-1","volume":"88","author":"XQ Zhang","year":"2010","unstructured":"Zhang, X.Q., Kang, L.Y., Cheng, Y.K.: The pos\/neg-weighted median problem on block graphs with subgraph-shaped customers. Computing 88, 97\u2013110 (2010)","journal-title":"Computing"}],"container-title":["Optimization Letters"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-015-0912-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11590-015-0912-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-015-0912-5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T13:11:42Z","timestamp":1559394702000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11590-015-0912-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,6,27]]},"references-count":23,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2016,8]]}},"alternative-id":["912"],"URL":"https:\/\/doi.org\/10.1007\/s11590-015-0912-5","relation":{},"ISSN":["1862-4472","1862-4480"],"issn-type":[{"value":"1862-4472","type":"print"},{"value":"1862-4480","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,6,27]]}}}