{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:38:01Z","timestamp":1759639081318},"publisher-location":"Cham","reference-count":11,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319557014"},{"type":"electronic","value":"9783319557021"}],"license":[{"start":{"date-parts":[[2017,7,21]],"date-time":"2017-07-21T00:00:00Z","timestamp":1500595200000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-319-55702-1_35","type":"book-chapter","created":{"date-parts":[[2017,7,20]],"date-time":"2017-07-20T14:21:16Z","timestamp":1500560476000},"page":"259-264","source":"Crossref","is-referenced-by-count":0,"title":["Maximum Covering Formulation for Open Locating Dominating Sets"],"prefix":"10.1007","author":[{"given":"Blair","family":"Sweigart","sequence":"first","affiliation":[]},{"given":"Rex","family":"Kincaid","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,7,21]]},"reference":[{"issue":"1\u20134","key":"35_CR1","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1016\/S0378-4371(00)00018-2","volume":"281","author":"A Barabsi","year":"2000","unstructured":"Barabsi, A., Albert, R., Jeong, H.: Scale-free characteristics of random networks: the topology of the world-wide web. Phys. A Stat. Mech. Appl. 281(1\u20134), 69\u201377 (2000)","journal-title":"Phys. A Stat. Mech. Appl."},{"issue":"3","key":"35_CR2","doi-asserted-by":"crossref","first-page":"2109","DOI":"10.1016\/S0304-3975(02)00536-4","volume":"290","author":"I Charon","year":"2003","unstructured":"Charon, I., Hudry, O., Lobstein, A.: Minimizing the size of an identifying or locating-dominating code in a graph is np-hard. Theoret. Comput. Sci. 290(3), 2109\u20132120 (2003)","journal-title":"Theoret. Comput. Sci."},{"key":"35_CR3","doi-asserted-by":"crossref","unstructured":"Church, R., Meadows, M.: Location modeling utilizing maximum service distance criteria. Geogr. Anal. 11 (1979)","DOI":"10.1111\/j.1538-4632.1979.tb00702.x"},{"key":"35_CR4","unstructured":"Daskin, M.: Network and Discrete Location: Models, Algorithms, and Applications. Wiley (2011)"},{"issue":"1","key":"35_CR5","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1016\/S0012-365X(01)00357-0","volume":"254","author":"I Honkala","year":"2002","unstructured":"Honkala, I., Laihonen, T., Ranto, S.: On strongly identifying codes. Discrete Math. 254(1), 191\u2013205 (2002)","journal-title":"Discrete Math."},{"issue":"2","key":"35_CR6","doi-asserted-by":"crossref","first-page":"599","DOI":"10.1109\/18.661507","volume":"44","author":"M Karpovsky","year":"1998","unstructured":"Karpovsky, M., Chakrabarty, K., Levitin, L.: On a new class of codes for identifying vertices in graphs. IEEE Trans. Inf. Theory 44(2), 599\u2013611 (1998)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"35_CR7","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1016\/j.dam.2015.04.024","volume":"193","author":"R Kincaid","year":"2015","unstructured":"Kincaid, R., Oldham, A., Yu, G.: Optimal open-locating-dominating sets in infinite triangular grids. Discrete Appl. Math. 193, 139\u2013144 (2015)","journal-title":"Discrete Appl. Math."},{"key":"35_CR8","unstructured":"Lobstein, A.: Watching systems, identifying, locating-dominating and discriminating codes in graphs. \nhttp:\/\/perso.telecom-paristech.fr\/~lobstein\/debutBIBidetlocdom.pdf\n\n (2016)"},{"key":"35_CR9","unstructured":"Slater, P., Seo, S.: Open neighborhood locating-dominating sets. Aust. J. Comb. 46 (2010)"},{"issue":"6","key":"35_CR10","doi-asserted-by":"crossref","first-page":"484","DOI":"10.1016\/j.dam.2010.12.010","volume":"159","author":"S Seo","year":"2011","unstructured":"Seo, S., Slater, P.: Open neighborhood locating-dominating in trees. Discrete Appl. Math. 159(6), 484\u2013489 (2011)","journal-title":"Discrete Appl. Math."},{"key":"35_CR11","doi-asserted-by":"crossref","unstructured":"Sweigart, D., Presnell, J., Kincaid, R.: An integer program for open locating dominating sets and its results on the hexagon-triangle infinite grid and other graphs. In: 2014 Systems and Information Engineering Design Symposium (SIEDS) (2014)","DOI":"10.1109\/SIEDS.2014.6829887"}],"container-title":["Operations Research Proceedings","Operations Research Proceedings 2016"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-55702-1_35","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,7,20]],"date-time":"2017-07-20T14:29:56Z","timestamp":1500560996000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-55702-1_35"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,7,21]]},"ISBN":["9783319557014","9783319557021"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-55702-1_35","relation":{},"ISSN":["0721-5924","2197-9294"],"issn-type":[{"type":"print","value":"0721-5924"},{"type":"electronic","value":"2197-9294"}],"subject":[],"published":{"date-parts":[[2017,7,21]]}}}