{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,31]],"date-time":"2022-03-31T05:39:15Z","timestamp":1648705155294},"reference-count":14,"publisher":"Springer Science and Business Media LLC","issue":"3-4","license":[{"start":{"date-parts":[[2010,6,4]],"date-time":"2010-06-04T00:00:00Z","timestamp":1275609600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Computing"],"published-print":{"date-parts":[[2010,7]]},"DOI":"10.1007\/s00607-010-0084-1","type":"journal-article","created":{"date-parts":[[2010,6,3]],"date-time":"2010-06-03T06:09:09Z","timestamp":1275545349000},"page":"97-110","source":"Crossref","is-referenced-by-count":2,"title":["The pos\/neg-weighted median problem on block graphs with subgraph-shaped customers"],"prefix":"10.1007","volume":"88","author":[{"given":"Xiaoqin","family":"Zhang","sequence":"first","affiliation":[]},{"given":"Liying","family":"Kang","sequence":"additional","affiliation":[]},{"given":"Yukun","family":"Cheng","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2010,6,4]]},"reference":[{"key":"84_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-Wesdey, Reading"},{"key":"84_CR2","unstructured":"Benkoczi R (2004) Cardinality constrained facility location problems in trees, Ph.D. thesis, Simon Fraser University"},{"key":"84_CR3","doi-asserted-by":"crossref","first-page":"1505","DOI":"10.1016\/j.disc.2005.11.031","volume":"306","author":"R Benkoczi","year":"2006","unstructured":"Benkoczi R, Breton D, Bhattacharya B (2006) Efficient computation of 2-medians in a tree network with positive\/negative weights. Discrete Math 306: 1505\u20131516","journal-title":"Discrete Math"},{"key":"84_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-Medians in trees with pos\/neg weights. Discrete Appl Math 105: 51\u201371","journal-title":"Discrete Appl Math"},{"key":"84_CR5","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 time method for the pos\/neg weighted 3-median problem on a tree. Math Meth Oper Res 65: 229\u2013238","journal-title":"Math Meth Oper Res"},{"key":"84_CR6","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 1-median problem on a cactus. Computing 60: 193\u2013215","journal-title":"Computing"},{"key":"84_CR7","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-349-03521-2","volume-title":"Graph theory with applications","author":"JA Bondy","year":"1976","unstructured":"Bondy JA, Murty USR (1976) Graph theory with applications. MacMillan, London"},{"key":"84_CR8","doi-asserted-by":"crossref","first-page":"1038","DOI":"10.1016\/j.tcs.2009.11.009","volume":"411","author":"YK Cheng","year":"2010","unstructured":"Cheng YK, Kang LY, Lu CH (2010) The pos\/neg-weighted 1-median problem on tree graphs with subtree-shaped customers. Theor Comp Sci 411: 1038\u20131044","journal-title":"Theor Comp Sci"},{"key":"84_CR9","doi-asserted-by":"crossref","first-page":"1288","DOI":"10.1016\/j.ic.2008.08.001","volume":"206","author":"RW Hung","year":"2008","unstructured":"Hung RW (2008) Optimal vertex ranking of block graphs. Inform Comput 206: 1288\u20131302","journal-title":"Inform Comput"},{"key":"84_CR10","doi-asserted-by":"crossref","unstructured":"Kang LY, Cheng YK (2008) The p-maxian problem on block graphs, J Comb Optim doi: 10.1007\/s10878-008-9198-1","DOI":"10.1007\/s10878-008-9198-1"},{"key":"84_CR11","doi-asserted-by":"crossref","first-page":"539","DOI":"10.1137\/0137041","volume":"37","author":"O Kariv","year":"1979","unstructured":"Kariv O, Hakimi SL (1979) An algorithmic approach to network location problems, Part II p-medians. SIAM J Appl Math 37: 539\u2013560","journal-title":"SIAM J Appl Math"},{"key":"84_CR12","doi-asserted-by":"crossref","unstructured":"Plastria F (2002) Continuous covering location problems. In: Drezner Z, Hamacher HW (eds) Facility location: applications and theory, Chap. 2. Springer, Berlin","DOI":"10.1007\/978-3-642-56082-8_2"},{"key":"84_CR13","doi-asserted-by":"crossref","first-page":"2890","DOI":"10.1016\/j.dam.2007.11.022","volume":"156","author":"J Puerto","year":"2008","unstructured":"Puerto J, Tamir A, Mesa JA, P\u00e9rez-Brito D (2008) Center location problems on tree graphs with subtree-shaped customers. Discrete Appl Math 156: 2890\u20132910","journal-title":"Discrete Appl Math"},{"key":"84_CR14","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1016\/S0304-3975(98)00180-7","volume":"225","author":"PK Wong","year":"1999","unstructured":"Wong PK (1999) Optimal path cover problem on block graphs. Theor Comp Sci 225: 163\u2013169","journal-title":"Theor Comp Sci"}],"container-title":["Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00607-010-0084-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00607-010-0084-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00607-010-0084-1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T14:30:22Z","timestamp":1559140222000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00607-010-0084-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,6,4]]},"references-count":14,"journal-issue":{"issue":"3-4","published-print":{"date-parts":[[2010,7]]}},"alternative-id":["84"],"URL":"https:\/\/doi.org\/10.1007\/s00607-010-0084-1","relation":{},"ISSN":["0010-485X","1436-5057"],"issn-type":[{"value":"0010-485X","type":"print"},{"value":"1436-5057","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,6,4]]}}}