{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T00:35:42Z","timestamp":1773275742384,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":8,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540309352","type":"print"},{"value":"9783540324263","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11602613_70","type":"book-chapter","created":{"date-parts":[[2005,12,2]],"date-time":"2005-12-02T08:24:24Z","timestamp":1133511864000},"page":"693-703","source":"Crossref","is-referenced-by-count":16,"title":["Efficient Algorithms for the Weighted 2-Center Problem in a Cactus Graph"],"prefix":"10.1007","author":[{"given":"Boaz","family":"Ben-Moshe","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Binay","family":"Bhattacharya","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Qiaosheng","family":"Shi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"70_CR1","doi-asserted-by":"crossref","first-page":"498","DOI":"10.1007\/BF02684332","volume":"60","author":"R.E. Burkard","year":"1998","unstructured":"Burkard, R.E., Krarup, J.: A linear algorithm for the pos\/neg-weighted 1-median problem on cactus. Comput.\u00a060, 498\u2013509 (1998)","journal-title":"Comput."},{"key":"70_CR2","doi-asserted-by":"publisher","first-page":"450","DOI":"10.1287\/opre.12.3.450","volume":"12","author":"S.L. Hakimi","year":"1964","unstructured":"Hakimi, S.L.: Optimum location of switching centers and the absolute centers and medians of a graph. Oper. Res.\u00a012, 450\u2013459 (1964)","journal-title":"Oper. Res."},{"key":"70_CR3","doi-asserted-by":"publisher","first-page":"513","DOI":"10.1137\/0137040","volume":"37","author":"O. Kariv","year":"1979","unstructured":"Kariv, O., Hakimi, S.L.: An algorithmic approach to network location problems, Part I. The p-centers. SIAM J. Appl. Math.\u00a037, 513\u2013538 (1979)","journal-title":"SIAM J. Appl. Math."},{"key":"70_CR4","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1016\/S0020-0190(99)00111-8","volume":"71","author":"Y.-F. Lan","year":"1999","unstructured":"Lan, Y.-F., Wang, Y.-L., Suzuki, H.: A linear-time algorithm for solving the center problem on weighted cactus graphs. Inform. Process. Lett.\u00a071, 205\u2013212 (1999)","journal-title":"Inform. Process. Lett."},{"issue":"4","key":"70_CR5","doi-asserted-by":"publisher","first-page":"759","DOI":"10.1137\/0212052","volume":"12","author":"N. Megiddo","year":"1983","unstructured":"Megiddo, N.: Linear-time algorithms for linear programming in R\n                           3 and related problems. SIAM J. Comput.\u00a012(4), 759\u2013776 (1983)","journal-title":"SIAM J. Comput."},{"issue":"4","key":"70_CR6","doi-asserted-by":"publisher","first-page":"751","DOI":"10.1137\/0212051","volume":"12","author":"N. Megiddo","year":"1983","unstructured":"Megiddo, N., Tamir, A.: New results on the complexity of p-center problems. SIAM J. Comput.\u00a012(4), 751\u2013758 (1983)","journal-title":"SIAM J. Comput."},{"issue":"3","key":"70_CR7","doi-asserted-by":"publisher","first-page":"377","DOI":"10.1137\/0401038","volume":"1","author":"A. Tamir","year":"1988","unstructured":"Tamir, A.: Improved complexity bounds for center location problems on networks by using dynamic data structures. SIAM J. Disc. Math.\u00a01(3), 377\u2013396 (1988)","journal-title":"SIAM J. Disc. Math."},{"key":"70_CR8","doi-asserted-by":"publisher","first-page":"377","DOI":"10.1016\/S0166-218X(03)00452-9","volume":"136","author":"B. Zmazek","year":"2004","unstructured":"Zmazek, B., \u017derovnik, J.: The obnoxious center problem on weighted cactus graphs. Disc. Appl. Math.\u00a0136, 377\u2013386 (2004)","journal-title":"Disc. Appl. Math."}],"container-title":["Lecture Notes in Computer Science","Algorithms and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11602613_70.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T07:03:04Z","timestamp":1619506984000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11602613_70"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540309352","9783540324263"],"references-count":8,"URL":"https:\/\/doi.org\/10.1007\/11602613_70","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2005]]}}}