{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,2,2]],"date-time":"2023-02-02T14:55:27Z","timestamp":1675349727261},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2012,6,4]],"date-time":"2012-06-04T00:00:00Z","timestamp":1338768000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Math Meth Oper Res"],"published-print":{"date-parts":[[2012,10]]},"DOI":"10.1007\/s00186-012-0394-5","type":"journal-article","created":{"date-parts":[[2012,9,25]],"date-time":"2012-09-25T17:19:20Z","timestamp":1348593560000},"page":"147-160","source":"Crossref","is-referenced-by-count":4,"title":["Finding a core of a tree with pos\/neg weight"],"prefix":"10.1007","volume":"76","author":[{"given":"Mehdi","family":"Zaferanieh","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jafar","family":"Fathali","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2012,6,4]]},"reference":[{"key":"394_CR1","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1007\/s10589-005-4800-2","volume":"32","author":"P Avella","year":"2005","unstructured":"Avella P, Boccia M, Sforza A, Vasil\u2019Ev I (2005) A branch-and-cut algorithm for the median-path problem. Comput Optim Appl 32: 215\u2013230","journal-title":"Comput Optim Appl"},{"key":"394_CR2","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":"394_CR3","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1016\/S0166-218X(01)00254-2","volume":"118","author":"RI Becker","year":"2002","unstructured":"Becker RI, Chang Y, Lari I, Scozzari A, Storchi G (2002) Finding the l-core of a tree. Discret Appl Math 118: 25\u201342","journal-title":"Discret Appl Math"},{"key":"394_CR4","doi-asserted-by":"crossref","first-page":"1505","DOI":"10.1016\/j.disc.2005.11.031","volume":"306","author":"R Benkoczia","year":"2006","unstructured":"Benkoczia R, Bhattacharya BK, Breton D (2006) Efficient computation of 2-medians in a tree network with positive\/negative weights. Discret Math 306: 1505\u20131516","journal-title":"Discret Math"},{"key":"394_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 polnomial 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":"394_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":"394_CR7","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, \u00c7ela E, Dollani H (2000) 2-Median in trees with pos\/neg weights. Discret Appl Math 105: 51\u201371","journal-title":"Discret Appl Math"},{"key":"394_CR8","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":"394_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 is O(nlog n) time. Networks 26: 305\u2013317","journal-title":"Networks"},{"key":"394_CR10","doi-asserted-by":"crossref","first-page":"212","DOI":"10.1287\/trsc.5.2.212","volume":"5","author":"AJ Goldman","year":"1971","unstructured":"Goldman AJ (1971) Optimal center location in simple networks. Transp Sci 5: 212\u2013221","journal-title":"Transp Sci"},{"key":"394_CR11","doi-asserted-by":"crossref","first-page":"98","DOI":"10.1287\/trsc.15.2.98","volume":"15","author":"SM Hedetniemi","year":"1981","unstructured":"Hedetniemi SM, Cockaine EJ, Hedetniemi ST (1981) Linear algorithms for finding the jordan center and path center of a tree. Transp Sci 15: 98\u2013114","journal-title":"Transp Sci"},{"key":"394_CR12","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":"394_CR13","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1016\/0196-6774(80)90012-7","volume":"1","author":"CA Morgan","year":"1980","unstructured":"Morgan CA, Slater PJ (1980) A linear algorithm for a core of a tree. J Algorithms 1: 247\u2013258","journal-title":"J Algorithms"},{"key":"394_CR14","doi-asserted-by":"crossref","first-page":"445","DOI":"10.1006\/jagm.1996.0022","volume":"20","author":"S Peng","year":"1996","unstructured":"Peng S, Lo W (1996) Efficient algorithms for finding a core of a tree with a specified length. J Algorithms 20: 445\u2013458","journal-title":"J Algorithms"},{"key":"394_CR15","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1287\/trsc.16.1.1","volume":"16","author":"PJ Slater","year":"1982","unstructured":"Slater PJ (1982) Locating central paths in a graph. Transp Sci 16: 1\u201318","journal-title":"Transp Sci"},{"key":"394_CR16","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 Discret Math 4: 550\u2013567","journal-title":"SIAM J Discret Math"},{"key":"394_CR17","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 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"},{"key":"394_CR18","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":"394_CR19","first-page":"87","volume":"4","author":"B Zelinka","year":"1968","unstructured":"Zelinka B (1968) Medians and peripherians of trees. Archvum Math 4: 87\u201395","journal-title":"Archvum Math"}],"container-title":["Mathematical Methods of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00186-012-0394-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00186-012-0394-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00186-012-0394-5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,23]],"date-time":"2019-05-23T10:33:30Z","timestamp":1558607610000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00186-012-0394-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,6,4]]},"references-count":19,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2012,10]]}},"alternative-id":["394"],"URL":"https:\/\/doi.org\/10.1007\/s00186-012-0394-5","relation":{},"ISSN":["1432-2994","1432-5217"],"issn-type":[{"value":"1432-2994","type":"print"},{"value":"1432-5217","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,6,4]]}}}