{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,14]],"date-time":"2026-01-14T18:33:39Z","timestamp":1768415619687,"version":"3.49.0"},"reference-count":22,"publisher":"Elsevier BV","issue":"2-3","license":[{"start":{"date-parts":[[2004,2,1]],"date-time":"2004-02-01T00:00:00Z","timestamp":1075593600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,8,22]],"date-time":"2013-08-22T00:00:00Z","timestamp":1377129600000},"content-version":"vor","delay-in-days":3490,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[2004,2]]},"DOI":"10.1016\/s0166-218x(03)00452-9","type":"journal-article","created":{"date-parts":[[2003,12,9]],"date-time":"2003-12-09T11:54:27Z","timestamp":1070970867000},"page":"377-386","source":"Crossref","is-referenced-by-count":21,"title":["The obnoxious center problem on weighted cactus graphs"],"prefix":"10.1016","volume":"136","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\/S0166-218X(03)00452-9_BIB1","series-title":"The Design and Analysis of Computer Algorithms","author":"Aho","year":"1974"},{"key":"10.1016\/S0166-218X(03)00452-9_BIB2","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1016\/S0377-2217(98)00237-9","article-title":"A note on the location of an obnoxious facility on a network","volume":"120","author":"Berman","year":"2000","journal-title":"European J. Oper. Res."},{"key":"10.1016\/S0166-218X(03)00452-9_BIB3","doi-asserted-by":"crossref","first-page":"2","DOI":"10.1006\/jpdc.1995.1002","article-title":"Distributed loop computer networks","volume":"24","author":"Bermond","year":"1995","journal-title":"J. Parallel Distributed Comput."},{"key":"10.1016\/S0166-218X(03)00452-9_BIB4","first-page":"1","article-title":"A tourist guide through treewidth","volume":"11","author":"Bodlaender","year":"1993","journal-title":"Acta Cybernet."},{"key":"10.1016\/S0166-218X(03)00452-9_BIB5","series-title":"Graph Classes, A Survey","author":"Brandst\u00e4dt","year":"2000"},{"key":"10.1016\/S0166-218X(03)00452-9_BIB6","series-title":"Distance in Graphs","author":"Buckley","year":"1990"},{"key":"10.1016\/S0166-218X(03)00452-9_BIB7","doi-asserted-by":"crossref","first-page":"498","DOI":"10.1137\/S0895480198340967","article-title":"The obnoxious center problem on a tree","volume":"14","author":"Burkard","year":"2001","journal-title":"SIAM J. Discrete Math."},{"key":"10.1016\/S0166-218X(03)00452-9_BIB8","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":"Comput."},{"key":"10.1016\/S0166-218X(03)00452-9_BIB9","unstructured":"P. Cappanera, A survey on obnoxious facility location problems, Technical Report TR-99-11, Universit\u00e1 di Pisa, Dipartimento di Informatica, 1999."},{"key":"10.1016\/S0166-218X(03)00452-9_BIB10","series-title":"Network and Discrete Location: Models, Algorithms and Applications","author":"Daskin","year":"1995"},{"key":"10.1016\/S0166-218X(03)00452-9_BIB11","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 Sci."},{"key":"10.1016\/S0166-218X(03)00452-9_BIB12","unstructured":"J.F. Fink, B. Elenbogen, Distance distributions for graphs modeling computer science networks, Manuscript 2000."},{"key":"10.1016\/S0166-218X(03)00452-9_BIB13","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1016\/0166-218X(86)90089-2","article-title":"A linear algorithm for finding a minimum dominating set in a cactus","volume":"13","author":"Hedetniemi","year":"1986","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0166-218X(03)00452-9_BIB14","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1016\/0166-218X(88)90017-0","article-title":"On some counting polynomials in Chemistry, applications of graphs in Chemistry and Physics","volume":"19","author":"Hosoya","year":"1988","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0166-218X(03)00452-9_BIB15","unstructured":"Discrete Math. 80 (1997) (special issue on the Wiener index)."},{"key":"10.1016\/S0166-218X(03)00452-9_BIB16","doi-asserted-by":"crossref","first-page":"401","DOI":"10.1016\/0196-6774(88)90030-2","article-title":"Diameters of weighted double loop networks","volume":"9","author":"Cheng","year":"1988","journal-title":"J. Algorithms"},{"key":"10.1016\/S0166-218X(03)00452-9_BIB17","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1016\/S0166-218X(97)00069-3","article-title":"Distance-related invariants on polygraphs","volume":"80","author":"Juvan","year":"1997","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0166-218X(03)00452-9_BIB18","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":"Inform. Process. Lett."},{"key":"10.1016\/S0166-218X(03)00452-9_BIB19","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1007\/BF01167206","article-title":"How to compute the Wiener index of a graph","volume":"2","author":"Mohar","year":"1988","journal-title":"J. Math. Chem."},{"key":"10.1016\/S0166-218X(03)00452-9_BIB20","doi-asserted-by":"crossref","first-page":"959","DOI":"10.1002\/(SICI)1097-461X(1996)60:5<959::AID-QUA2>3.0.CO;2-W","article-title":"The Wiener polynomial of a graph","volume":"60","author":"Sagan","year":"1996","journal-title":"Internat. J. Quantum Chem."},{"key":"10.1016\/S0166-218X(03)00452-9_BIB21","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 J. Discrete Math."},{"key":"10.1016\/S0166-218X(03)00452-9_BIB22","doi-asserted-by":"crossref","first-page":"226","DOI":"10.1006\/jagm.1993.1011","article-title":"Computing the diameter in multiple-loop networks","volume":"14","author":"\u017derovnik","year":"1993","journal-title":"J. Algorithms"}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X03004529?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X03004529?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,2,16]],"date-time":"2019-02-16T10:29:10Z","timestamp":1550312950000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X03004529"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004,2]]},"references-count":22,"journal-issue":{"issue":"2-3","published-print":{"date-parts":[[2004,2]]}},"alternative-id":["S0166218X03004529"],"URL":"https:\/\/doi.org\/10.1016\/s0166-218x(03)00452-9","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[2004,2]]}}}