{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,25]],"date-time":"2026-03-25T12:01:36Z","timestamp":1774440096828,"version":"3.50.1"},"reference-count":11,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2016,7,13]],"date-time":"2016-07-13T00:00:00Z","timestamp":1468368000000},"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":["J Comb Optim"],"published-print":{"date-parts":[[2018,7]]},"DOI":"10.1007\/s10878-016-0058-0","type":"journal-article","created":{"date-parts":[[2016,7,13]],"date-time":"2016-07-13T13:20:02Z","timestamp":1468416002000},"page":"252-263","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":10,"title":["Algorithms for connected p-centdian problem on block graphs"],"prefix":"10.1007","volume":"36","author":[{"given":"Liying","family":"Kang","sequence":"first","affiliation":[]},{"given":"Jianjie","family":"Zhou","sequence":"additional","affiliation":[]},{"given":"Erfang","family":"Shan","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,7,13]]},"reference":[{"key":"58_CR1","doi-asserted-by":"crossref","first-page":"1395","DOI":"10.1016\/S0305-0548(99)00042-8","volume":"26","author":"I Averbakh","year":"1999","unstructured":"Averbakh I, Berman O (1999) Algorithms for path medi-centers of a tree. Comput Oper Res 26:1395\u20131409","journal-title":"Comput Oper Res"},{"key":"58_CR2","doi-asserted-by":"crossref","first-page":"1208","DOI":"10.1016\/j.ejor.2005.09.049","volume":"179","author":"RI Becker","year":"2007","unstructured":"Becker RI, Lari I, Scozzari A (2007) Algorithms for central-median paths with bounded length on trees. Eur J Oper Res 179:1208\u20131220","journal-title":"Eur J Oper Res"},{"key":"58_CR3","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1016\/j.dam.2009.09.024","volume":"158","author":"A Behtoei","year":"2010","unstructured":"Behtoei A, Jannesari M, Tseri B (2010) A characterization of block graphs. Discret Appl Math 158:219\u2013221","journal-title":"Discret Appl Math"},{"key":"58_CR4","doi-asserted-by":"crossref","first-page":"395","DOI":"10.1002\/net.3230150402","volume":"15","author":"ML Chen","year":"1985","unstructured":"Chen ML, Francis RL, Lawrence JF, Lowe TJ, Tufekci S (1985) Block-vertex duality and the one-median problem. Networks 15:395\u2013412","journal-title":"Networks"},{"key":"58_CR5","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1111\/j.1467-9787.1976.tb00966.x","volume":"16","author":"J Halpern","year":"1976","unstructured":"Halpern J (1976) The location of a cent-dian convex conbination on an undirected tree. J Reg Sci 16:237\u2013245","journal-title":"J Reg Sci"},{"key":"58_CR6","doi-asserted-by":"crossref","first-page":"535","DOI":"10.1287\/mnsc.24.5.535","volume":"24","author":"J Halpern","year":"1978","unstructured":"Halpern J (1978) Finding minimal center-median combination (cent-dian) of a graph. Manag Sci 24:535\u2013544","journal-title":"Manag Sci"},{"key":"58_CR7","doi-asserted-by":"crossref","first-page":"246","DOI":"10.1287\/trsc.19.3.246","volume":"19","author":"GY Handler","year":"1985","unstructured":"Handler GY (1985) Medi-centers of a tree. Transp Sci 19:246\u2013260","journal-title":"Transp Sci"},{"key":"58_CR8","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1051\/ro\/1991250100731","volume":"25","author":"P Hansen","year":"1991","unstructured":"Hansen P, Labbe M, Thisse J-F (1991) From the median to the generalized center. Oper Res 25:73\u201386","journal-title":"Oper Res"},{"key":"58_CR9","unstructured":"Shan E, Zhou J, Kang L The connected \n                        $$p$$\n                        \n                            \n                                p\n                            \n                        \n                    -center and \n                        $$p$$\n                        \n                            \n                                p\n                            \n                        \n                    -median problems on interval and circular-arc graphs. Acta Math Appl Sin (to appear)"},{"key":"58_CR10","doi-asserted-by":"crossref","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 (2002) The centdian subtree on tree networks. Discret Appl Math 118:263\u2013278","journal-title":"Discret Appl Math"},{"key":"58_CR11","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1016\/j.tcs.2011.12.013","volume":"426","author":"WC-K Yen","year":"2012","unstructured":"Yen WC-K (2012) The connected \n                        $$p$$\n                        \n                            \n                                p\n                            \n                        \n                    -center problem on block graphs with forbidden vertices. Theor Comput Sci 426:13\u201324","journal-title":"Theor Comput Sci"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-016-0058-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-016-0058-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-016-0058-0","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-016-0058-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2018,6,5]],"date-time":"2018-06-05T12:19:59Z","timestamp":1528201199000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-016-0058-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,7,13]]},"references-count":11,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2018,7]]}},"alternative-id":["58"],"URL":"https:\/\/doi.org\/10.1007\/s10878-016-0058-0","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,7,13]]}}}