{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,28]],"date-time":"2025-09-28T12:45:50Z","timestamp":1759063550501},"reference-count":16,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2008,10,10]],"date-time":"2008-10-10T00:00:00Z","timestamp":1223596800000},"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,7]]},"DOI":"10.1007\/s10878-008-9187-4","type":"journal-article","created":{"date-parts":[[2008,10,9]],"date-time":"2008-10-09T14:06:45Z","timestamp":1223561205000},"page":"27-46","source":"Crossref","is-referenced-by-count":11,"title":["Median problems with positive and negative weights on\u00a0cycles and cacti"],"prefix":"10.1007","volume":"20","author":[{"given":"Rainer E.","family":"Burkard","sequence":"first","affiliation":[]},{"given":"Johannes","family":"Hatzl","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2008,10,10]]},"reference":[{"key":"9187_CR1","unstructured":"Benkoczi R (2004) Cardinality constrained facility location problems in trees. PhD thesis, Simon Fraser University"},{"key":"9187_CR2","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":"9187_CR3","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1016\/S0166-218X(00)00177-3","volume":"105","author":"R Burkard","year":"2000","unstructured":"Burkard R, \u00c7ela E, Dollani H (2000) 2-medians in trees with pos\/neg weights. Discrete Appl Math 105: 51\u201371","journal-title":"Discrete Appl Math"},{"key":"9187_CR4","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1007\/s00186-006-0121-1","volume":"65","author":"R Burkard","year":"2007","unstructured":"Burkard R, Fathali J (2007) A polynomial time method for the pos\/neg weighted 3-median problem on a tree. Math Methods Oper Res 65:229\u2013238","journal-title":"Math Methods Oper Res"},{"key":"9187_CR5","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1007\/BF02684332","volume":"60","author":"R Burkard","year":"1998","unstructured":"Burkard R, 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":"9187_CR6","doi-asserted-by":"crossref","first-page":"331","DOI":"10.1016\/j.orl.2006.03.016","volume":"35","author":"R Burkard","year":"2007","unstructured":"Burkard R, Fathali J, Taghizadeh H (2007) The p-maxian problem on a tree. Oper Res Lett 35:331\u2013335","journal-title":"Oper Res Lett"},{"key":"9187_CR7","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1287\/trsc.12.2.107","volume":"12","author":"R Church","year":"1978","unstructured":"Church R, Garfinkel R (1978) Locating an obnoxious facility on a network. Transp Sci 12:107\u2013118","journal-title":"Transp Sci"},{"key":"9187_CR8","volume-title":"Computers and intractability: a guide to the theory of NP-completeness","author":"MR Garey","year":"1979","unstructured":"Garey MR, Johnson DS (1979) Computers and intractability: a guide to the theory of NP-completeness. Freeman, New York"},{"key":"9187_CR9","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1002\/net.3230260413","volume":"26","author":"B Gavish","year":"1995","unstructured":"Gavish B, Sridhar S (1995) Computing the 2-median on tree networks in $\\mathcal{O}(n\\log n)$ time. Networks 26:305\u2013317","journal-title":"Networks"},{"key":"9187_CR10","doi-asserted-by":"crossref","first-page":"212","DOI":"10.1287\/trsc.5.2.212","volume":"5","author":"A Goldman","year":"1971","unstructured":"Goldman A (1971) Optimal center location in simple networks. Transp Sci 5:212\u2013221","journal-title":"Transp Sci"},{"key":"9187_CR11","doi-asserted-by":"crossref","first-page":"450","DOI":"10.1287\/opre.12.3.450","volume":"12","author":"S Hakimi","year":"1964","unstructured":"Hakimi S (1964) Optimal locations of switching centers and the absolute centers and medians of a graph. Oper Res 12:450\u2013459","journal-title":"Oper Res"},{"key":"9187_CR12","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1287\/trsc.7.3.287","volume":"7","author":"G Handler","year":"1973","unstructured":"Handler G (1973) Minimax location of a facility in an undirected tree graph. Transp Sci 7:287\u2013293","journal-title":"Transp Sci"},{"key":"9187_CR13","first-page":"77","volume":"2","author":"L Hua","year":"1962","unstructured":"Hua L (1962) Applications of mathematical methods for wheat harvesting. Chin Math 2:77\u201391","journal-title":"Chin Math"},{"key":"9187_CR14","doi-asserted-by":"crossref","first-page":"539","DOI":"10.1137\/0137041","volume":"27","author":"O Kariv","year":"1979","unstructured":"Kariv O, Hakimi S (1979) An algorithmic approach to network location problems, Part II: p-medians. SIAM J Appl Math 27:539\u2013560","journal-title":"SIAM J Appl Math"},{"key":"9187_CR15","first-page":"55","volume-title":"Discrete location theory","author":"P Mirchandani","year":"1990","unstructured":"Mirchandani P (1990) The p-median problem and generalizations. In: Mirchandani P, Francis R (eds) Discrete location theory. Wiley, New York, pp 55\u2013117"},{"key":"9187_CR16","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 (1996) An $\\mathcal{O}(pn^{2})$ algorithm for the p-median and related problems on tree graphs. Oper Res Lett 19:59\u201364","journal-title":"Oper Res Lett"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-008-9187-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-008-9187-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-008-9187-4","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-9187-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,10,10]]},"references-count":16,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2010,7]]}},"alternative-id":["9187"],"URL":"https:\/\/doi.org\/10.1007\/s10878-008-9187-4","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008,10,10]]}}}