{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,25]],"date-time":"2026-03-25T06:48:12Z","timestamp":1774421292558,"version":"3.50.1"},"reference-count":17,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[1982,12,1]],"date-time":"1982-12-01T00:00:00Z","timestamp":407548800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Mathematical Programming"],"published-print":{"date-parts":[[1982,12]]},"DOI":"10.1007\/bf01581045","type":"journal-article","created":{"date-parts":[[2005,4,28]],"date-time":"2005-04-28T09:55:29Z","timestamp":1114682129000},"page":"304-315","source":"Crossref","is-referenced-by-count":53,"title":["Polynomially bounded algorithms for locatingp-centers on a tree"],"prefix":"10.1007","volume":"22","author":[{"given":"R.","family":"Chandrasekaran","sequence":"first","affiliation":[]},{"given":"A.","family":"Tamir","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"CR1","doi-asserted-by":"crossref","unstructured":"M. Blum, R.W. Floyd, V.R. Pratt, R.L. Rivest and R.E. Tarjan, \u201cTime bounds for selection\u201d,Journal of Computer and System Science 7 (1973).","DOI":"10.1016\/S0022-0000(73)80033-9"},{"key":"CR2","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1016\/0012-365X(74)90002-8","volume":"9","author":"P. Buneman","year":"1974","unstructured":"P. Buneman, \u201cA characterization of rigid circuit graphs\u201d,Discrete Mathematics 9 (1974) 205\u2013212.","journal-title":"Discrete Mathematics"},{"key":"CR3","series-title":"Discussion paper","volume-title":"Problems of location on trees","author":"R. Chandrasekaran","year":"1978","unstructured":"R. Chandrasekaran and A. Daughety, \u201cProblems of location on trees\u201d, Discussion paper No. 357, Center for Mathematical Studies in Economics and Management, Northwestern University (Evanston, 1978)."},{"key":"CR4","doi-asserted-by":"crossref","first-page":"333","DOI":"10.1287\/trsc.8.4.333","volume":"8","author":"P.M. Dearing","year":"1974","unstructured":"P.M. Dearing and R.L. Francis, \u201cA minimax location problem on a network,\u201dTransportation Science 8 (1974) 333\u2013343.","journal-title":"Transportation Science"},{"key":"CR5","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1007\/BF02992776","volume":"25","author":"G.A. Dirac","year":"1974","unstructured":"G.A. Dirac, \u201cOn rigid circuit graphs\u201d,Abhandlung Mathematics Seminar University of Hamburg 25 (1974) 71\u201376.","journal-title":"Abhandlung Mathematics Seminar University of Hamburg"},{"key":"CR6","doi-asserted-by":"crossref","first-page":"168","DOI":"10.1007\/BF01584085","volume":"1","author":"D.R. Fulkerson","year":"1971","unstructured":"D.R. Fulkerson, \u201cBlocking and anti-blocking pairs of polyhedra\u201d,Mathematical Programming 1 (1971) 168\u2013194.","journal-title":"Mathematical Programming"},{"key":"CR7","doi-asserted-by":"crossref","first-page":"180","DOI":"10.1137\/0201013","volume":"1","author":"F. Gavril","year":"1972","unstructured":"F. Gavril, \u201cAlgorithms for minimum coloring, maximum clique, minimum covering by cliques, and maximum independent set of a chordal graph\u201d,SIAM Journal on Computing 1 (1972) 180\u2013187.","journal-title":"SIAM Journal on Computing"},{"key":"CR8","doi-asserted-by":"crossref","first-page":"407","DOI":"10.1287\/trsc.6.4.407","volume":"6","author":"A.J. Goldman","year":"1972","unstructured":"A.J. Goldman, \u201cMinimax location of facility in an undirected tree graph\u201d,Transportation Science 6 (1972) 407\u2013418.","journal-title":"Transportation Science"},{"key":"CR9","doi-asserted-by":"crossref","first-page":"450","DOI":"10.1287\/opre.12.3.450","volume":"12","author":"S.L. Hakimi","year":"1964","unstructured":"S.L. Hakimi, \u201cOptimum locations of switching centers and the absolute centers and medians of a graph\u201d,Operations Research 12 (1964) 450\u2013459.","journal-title":"Operations Research"},{"key":"CR10","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1287\/trsc.12.1.1","volume":"12","author":"S.L. Hakimi","year":"1978","unstructured":"S.L. Hakimi, E.F. Schmeichel and J.G. Pierce, \u201cOnp-centers in networks\u201d,Transportation Science 12 (1978) 1\u201315.","journal-title":"Transportation Science"},{"key":"CR11","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1287\/trsc.12.2.93","volume":"12","author":"G.Y. Handler","year":"1978","unstructured":"G.Y. Handler, \u201cFinding two-centers of a tree: the continuous case\u201d,Transportation Science 12 (1978) 93\u2013106.","journal-title":"Transportation Science"},{"key":"CR12","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1287\/trsc.7.3.287","volume":"7","author":"G.Y. Handler","year":"1973","unstructured":"G.Y. Handler, \u201cMinimax location of a facility in an undirected tree graph\u201d,Transportation Science 7 (1973) 287\u2013293.","journal-title":"Transportation Science"},{"key":"CR13","doi-asserted-by":"crossref","first-page":"513","DOI":"10.1137\/0137040","volume":"37","author":"O. Kariv","year":"1979","unstructured":"O. Kariv and S.L. Hakimi, \u201cAn algorithmic approach to network location problems, part 1: thep-centers\u201d,SIAM Journal on Applied Mathematics 37 (1979) 513\u2013538.","journal-title":"SIAM Journal on Applied Mathematics"},{"key":"CR14","doi-asserted-by":"crossref","first-page":"138","DOI":"10.1137\/1012016","volume":"12","author":"E. Minieka","year":"1970","unstructured":"E. Minieka, \u201cThem-center problem\u201d,SIAM Review 12 (1970) 138\u2013139.","journal-title":"SIAM Review"},{"key":"CR15","doi-asserted-by":"crossref","first-page":"180","DOI":"10.1007\/BF01580235","volume":"6","author":"M.W. Padberg","year":"1974","unstructured":"M.W. Padberg, \u201cPerfect zero\u2013one matrices\u201d,Mathematical Programming 6 (1974) 180\u2013196.","journal-title":"Mathematical Programming"},{"key":"CR16","doi-asserted-by":"crossref","first-page":"266","DOI":"10.1137\/0205021","volume":"5","author":"D.J. Rose","year":"1976","unstructured":"D.J. Rose, R.E. Tarjan and G.S. Lueken, \u201cAlgorithmic aspects of vertex elimination on graphs\u201d,SIAM Journal on Computing 5 (1976) 266\u2013283.","journal-title":"SIAM Journal on Computing"},{"key":"CR17","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1287\/trsc.11.3.243","volume":"11","author":"D.R. Shier","year":"1977","unstructured":"D.R. Shier, \u201cA min\u2014max theorem forp-center problems on a tree\u201d,Transportation Science 11 (1977) 243\u2013252.","journal-title":"Transportation Science"}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01581045.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01581045\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01581045","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,3]],"date-time":"2019-05-03T15:12:14Z","timestamp":1556896334000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01581045"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1982,12]]},"references-count":17,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1982,12]]}},"alternative-id":["BF01581045"],"URL":"https:\/\/doi.org\/10.1007\/bf01581045","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[1982,12]]}}}