{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,28]],"date-time":"2025-09-28T12:47:20Z","timestamp":1759063640341},"reference-count":11,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2008,12,16]],"date-time":"2008-12-16T00:00:00Z","timestamp":1229385600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2010,8]]},"DOI":"10.1007\/s10878-008-9198-1","type":"journal-article","created":{"date-parts":[[2008,12,15]],"date-time":"2008-12-15T15:46:32Z","timestamp":1229355992000},"page":"131-141","source":"Crossref","is-referenced-by-count":9,"title":["The p-maxian problem on block graphs"],"prefix":"10.1007","volume":"20","author":[{"given":"Liying","family":"Kang","sequence":"first","affiliation":[]},{"given":"Yukun","family":"Cheng","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2008,12,16]]},"reference":[{"key":"9198_CR1","volume-title":"The design and analysis of computer algorithms","author":"AV Aho","year":"1974","unstructured":"Aho AV, Hopcropt JE, Ullman JD (1974) The design and analysis of computer algorithms. Addison-Wesley, Reading"},{"key":"9198_CR2","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1007\/s00186-006-0121-1","volume":"65","author":"RE Burkard","year":"2007","unstructured":"Burkard RE, Fathali J (2007) A polynomial method for the pos\/neg weighted 3-medians problem on a tree. Math Meth Oper Res 65:229\u2013238","journal-title":"Math Meth Oper Res"},{"key":"9198_CR3","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1007\/BF02684332","volume":"60","author":"RE Burkard","year":"1998","unstructured":"Burkard RE, Krarup J (1998) A linear algorithm for the pos\/neg-weighted median problem on a cactus. Computing 60:193\u2013215","journal-title":"Computing"},{"key":"9198_CR4","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1016\/S0166-218X(00)00177-3","volume":"105","author":"RE Burkard","year":"2000","unstructured":"Burkard RE, Cela E, Dollani H (2000) 2-median in trees with pos\/neg weights. Discrete Appl Math 105:51\u201371","journal-title":"Discrete Appl Math"},{"key":"9198_CR5","doi-asserted-by":"crossref","first-page":"331","DOI":"10.1016\/j.orl.2006.03.016","volume":"35","author":"RE Burkard","year":"2007","unstructured":"Burkard RE, Fathali J, Kakhki HT (2007) The p-maxian problem on a tree. Oper Res Lett 35:331\u2013335","journal-title":"Oper Res Lett"},{"key":"9198_CR6","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1287\/trsc.12.2.107","volume":"12","author":"RL Church","year":"1978","unstructured":"Church RL, Garfinkel RS (1978) Locating an obnoxious facility on a network. Transp Sci 12:107\u2013118","journal-title":"Transp Sci"},{"key":"9198_CR7","doi-asserted-by":"crossref","first-page":"50","DOI":"10.1007\/s10878-007-9098-9","volume":"16","author":"E Gassner","year":"2008","unstructured":"Gassner E (2008) The inverse 1-maxian problem with edge length modification. J Comb Optim 16:50\u201367","journal-title":"J Comb Optim"},{"key":"9198_CR8","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1287\/trsc.7.3.287","volume":"7","author":"GY Handler","year":"1973","unstructured":"Handler GY (1973) Minimax location of a facility in an undirected tree networks. Transp Sci 7:287\u2013293","journal-title":"Transp Sci"},{"key":"9198_CR9","doi-asserted-by":"crossref","first-page":"550","DOI":"10.1137\/0404048","volume":"4","author":"A Tamir","year":"1991","unstructured":"Tamir A (1991) Obnoxious facility location on graphs. SIAM J Discrete Math 4:550\u2013567","journal-title":"SIAM J Discrete Math"},{"key":"9198_CR10","doi-asserted-by":"crossref","first-page":"76","DOI":"10.1287\/trsc.18.1.76","volume":"18","author":"SS Ting","year":"1984","unstructured":"Ting SS (1984) A linear-time algorithm for maxisum facility location on tree networks. Transp Sci 18:76\u201384","journal-title":"Transp Sci"},{"key":"9198_CR11","first-page":"87","volume":"4","author":"B Zelinka","year":"1968","unstructured":"Zelinka B (1968) Medians and peripherians of trees. Arch Math 4:87\u201395","journal-title":"Arch Math"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-008-9198-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-008-9198-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-008-9198-1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T04:18:13Z","timestamp":1559276293000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-008-9198-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,12,16]]},"references-count":11,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2010,8]]}},"alternative-id":["9198"],"URL":"https:\/\/doi.org\/10.1007\/s10878-008-9198-1","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008,12,16]]}}}