{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,10]],"date-time":"2024-07-10T19:47:49Z","timestamp":1720640869642},"reference-count":6,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2001,5,1]],"date-time":"2001-05-01T00:00:00Z","timestamp":988675200000},"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":["Electronic Notes in Discrete Mathematics"],"published-print":{"date-parts":[[2001,5]]},"DOI":"10.1016\/s1571-0653(05)80099-x","type":"journal-article","created":{"date-parts":[[2005,5,6]],"date-time":"2005-05-06T23:09:41Z","timestamp":1115420981000},"page":"133-136","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["The obnoxious center problem on weighted cactus graphs (Extended Abstract)"],"prefix":"10.1016","volume":"8","author":[{"given":"Bla\u017e","family":"Zmazek","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Janez","family":"\u017derovnik","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S1571-0653(05)80099-X_BIB1","author":"Burkard","year":"1998","journal-title":"The Obnoxious Center Problem on a Tree, Karl-Franzens-Universitaet Graz and Technische Universitaet Graz, Opti-mierung und Kontrolle, Bericht Nr. 128"},{"key":"10.1016\/S1571-0653(05)80099-X_BIB2","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1007\/BF02684332","article-title":"A Linear Algorithm for the pos\/neg-weighted 1-median Problem on Cactus","volume":"60","author":"Burkard","year":"1998","journal-title":"Computing"},{"key":"10.1016\/S1571-0653(05)80099-X_BIB3","series-title":"Network and Discrete Location: Models, Algorithms And Applications","author":"Daskin","year":"1995"},{"key":"10.1016\/S1571-0653(05)80099-X_BIB4","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1287\/trsc.19.3.193","article-title":"Location of Multiple Obnoxious Facilities","volume":"19","author":"Drezdner","year":"1985","journal-title":"Transportation Science"},{"key":"10.1016\/S1571-0653(05)80099-X_BIB5","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1016\/S0020-0190(99)00111-8","article-title":"A Linear-Time Algorithm for Solving the Center Problem on Weighted Cactus Graphs","volume":"71","author":"Lan","year":"1999","journal-title":"Information Processing Letters"},{"key":"10.1016\/S1571-0653(05)80099-X_BIB6","doi-asserted-by":"crossref","first-page":"550","DOI":"10.1137\/0404048","article-title":"Obnoxious Facility Location on Graphs","volume":"4","author":"Tamir","year":"1991","journal-title":"SIAM Journal of Discrete Mathematics"}],"container-title":["Electronic Notes in Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S157106530580099X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S157106530580099X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,1,26]],"date-time":"2019-01-26T17:24:49Z","timestamp":1548523489000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S157106530580099X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,5]]},"references-count":6,"alternative-id":["S157106530580099X"],"URL":"https:\/\/doi.org\/10.1016\/s1571-0653(05)80099-x","relation":{},"ISSN":["1571-0653"],"issn-type":[{"value":"1571-0653","type":"print"}],"subject":[],"published":{"date-parts":[[2001,5]]}}}