{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,25]],"date-time":"2026-03-25T06:48:00Z","timestamp":1774421280954,"version":"3.50.1"},"reference-count":11,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1997,8,1]],"date-time":"1997-08-01T00:00:00Z","timestamp":870393600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["European Journal of Operational Research"],"published-print":{"date-parts":[[1997,8]]},"DOI":"10.1016\/s0377-2217(96)00076-8","type":"journal-article","created":{"date-parts":[[2003,4,5]],"date-time":"2003-04-05T00:21:01Z","timestamp":1049502061000},"page":"594-607","source":"Crossref","is-referenced-by-count":13,"title":["Generalized p-Center problems: Complexity results and approximation algorithms"],"prefix":"10.1016","volume":"100","author":[{"given":"Dorit S.","family":"Hochbaum","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Anu","family":"Pathria","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0377-2217(96)00076-8_BIB1","series-title":"Network Flows: Theory, Algorithms, and Applications","author":"Ahuja","year":"1993"},{"key":"10.1016\/S0377-2217(96)00076-8_BIB2","doi-asserted-by":"crossref","first-page":"691","DOI":"10.1137\/0205048","article-title":"On the complexity of timetable and multicommodity flow problems","volume":"5","author":"Even","year":"1976","journal-title":"SIAM Journal on Computing"},{"key":"10.1016\/S0377-2217(96)00076-8_BIB3","series-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"Garey","year":"1979"},{"key":"10.1016\/S0377-2217(96)00076-8_BIB4","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1016\/0304-3975(85)90224-5","article-title":"Clustering to minimize the maximum intercluster distance","volume":"38\/2\u20133","author":"Gonzalez","year":"1985","journal-title":"Theoretical Computer Science"},{"key":"10.1016\/S0377-2217(96)00076-8_BIB5","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF01185335","article-title":"The slab dividing approach to solve the Euclidean p-Center problem","volume":"9","author":"Hwang","year":"1993","journal-title":"Algorithmica"},{"key":"10.1016\/S0377-2217(96)00076-8_BIB6","series-title":"LU-matchings","author":"Hochbaum","year":"1994"},{"key":"10.1016\/S0377-2217(96)00076-8_BIB7","doi-asserted-by":"crossref","first-page":"533","DOI":"10.1145\/5925.5933","article-title":"A unified approach to approximation algorithms for Bottleneck problems","volume":"33\/3","author":"Hochbaum","year":"1986","journal-title":"Journal of the Association for Computing Machinery"},{"key":"10.1016\/S0377-2217(96)00076-8_BIB8","doi-asserted-by":"crossref","first-page":"439","DOI":"10.1007\/BF01415760","article-title":"On alternative p-Center problems","volume":"36","author":"Hudec","year":"1991","journal-title":"Zeitschrift f\u00fcr Operations Research - Methods and Models of Operations Research"},{"key":"10.1016\/S0377-2217(96)00076-8_BIB9","series-title":"Complexity of Computer Computations","first-page":"85","article-title":"Reducibility among combinatorial problems","author":"Karp","year":"1972"},{"key":"10.1016\/S0377-2217(96)00076-8_BIB10","doi-asserted-by":"crossref","first-page":"513","DOI":"10.1137\/0137040","article-title":"An algorithmic approach to network location problems: The p-Centers","volume":"3","author":"Kariv","year":"1979","journal-title":"SIAM Journal on Applied Mathematics"},{"key":"10.1016\/S0377-2217(96)00076-8_BIB11","doi-asserted-by":"crossref","first-page":"759","DOI":"10.1137\/0212052","article-title":"Linear-time algorithms for linear programming in R3 and related problems","volume":"12\/4","author":"Megiddo","year":"1983","journal-title":"SIAM Journal on Computing"}],"container-title":["European Journal of Operational Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221796000768?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221796000768?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,30]],"date-time":"2019-04-30T20:57:18Z","timestamp":1556657838000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0377221796000768"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,8]]},"references-count":11,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1997,8]]}},"alternative-id":["S0377221796000768"],"URL":"https:\/\/doi.org\/10.1016\/s0377-2217(96)00076-8","relation":{},"ISSN":["0377-2217"],"issn-type":[{"value":"0377-2217","type":"print"}],"subject":[],"published":{"date-parts":[[1997,8]]}}}