{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T05:46:19Z","timestamp":1725860779416},"publisher-location":"Cham","reference-count":24,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319411675"},{"type":"electronic","value":"9783319411682"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"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":[[2016]]},"DOI":"10.1007\/978-3-319-41168-2_8","type":"book-chapter","created":{"date-parts":[[2016,7,3]],"date-time":"2016-07-03T21:26:28Z","timestamp":1467581188000},"page":"89-100","source":"Crossref","is-referenced-by-count":0,"title":["Separating Codes and Traffic Monitoring"],"prefix":"10.1007","author":[{"given":"Thomas","family":"Bellitto","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,7,5]]},"reference":[{"key":"8_CR1","doi-asserted-by":"crossref","unstructured":"Arden, D.N.: Delayed-logic and finite-state machines. In: Proceedings of the 2nd Annual Symposium on Switching Circuit Theory and Logical Design (SWCT 1961), FOCS 1961, pp. 133\u2013151. IEEE Computer Society, Washington, DC (1961)","DOI":"10.1109\/FOCS.1961.13"},{"key":"8_CR2","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1016\/j.endm.2013.10.027","volume":"44","author":"GR Argiroffo","year":"2013","unstructured":"Argiroffo, G.R., Bianchi, S.M., Wagler, A.K.: Polyhedra associated with identifying codes. Electron. Not. Discrete Math. 44, 175\u2013180 (2013)","journal-title":"Electron. Not. Discrete Math."},{"issue":"1\u20133","key":"8_CR3","doi-asserted-by":"crossref","first-page":"477","DOI":"10.1007\/s10107-003-0414-6","volume":"98","author":"KMJ Bontridder De","year":"2003","unstructured":"De Bontridder, K.M.J., Halld\u00f3rsson, B.V., Halld\u00f3rsson, M.M., Hurkens, C.A.J., Lenstra, J.K., Ravi, R., Stougie, L.: Approximation algorithms for the test cover problem. Math. Program. 98(1\u20133), 477\u2013491 (2003)","journal-title":"Math. Program."},{"issue":"4","key":"8_CR4","doi-asserted-by":"crossref","first-page":"403","DOI":"10.3934\/amc.2008.2.403","volume":"2","author":"E Charbit","year":"2008","unstructured":"Charbit, E., Charon, I., Cohen, G.D., Hudry, O., Lobstein, A.: Discriminating codes in bipartite graphs: bounds, extremal cardinalities, complexity. Adv. Math. Comm. 2(4), 403\u2013420 (2008)","journal-title":"Adv. Math. Comm."},{"issue":"5","key":"8_CR5","doi-asserted-by":"crossref","first-page":"1353","DOI":"10.1016\/j.ejc.2007.05.006","volume":"29","author":"I Charon","year":"2008","unstructured":"Charon, I., Cohen, G.D., Hudry, O., Lobstein, A.: Discriminating codes in (bipartite) planar graphs. Eur. J. Comb. 29(5), 1353\u20131364 (2008)","journal-title":"Eur. J. Comb."},{"issue":"3","key":"8_CR6","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":"8_CR7","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability; A Guide to the Theory of NP-Completeness. W. H. Freeman & Co., New York (1990)"},{"key":"8_CR8","doi-asserted-by":"crossref","first-page":"108","DOI":"10.1186\/1471-2105-7-108","volume":"7","author":"TW Haynes","year":"2006","unstructured":"Haynes, T.W., Knisley, D.J., Seier, E., Zou, Y.: A quantitative analysis of secondary RNA structure using domination based parameters on trees. BMC Bioinform. 7, 108 (2006)","journal-title":"BMC Bioinform."},{"issue":"1\u20133","key":"8_CR9","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1016\/S0012-365X(01)00357-0","volume":"254","author":"IS Honkala","year":"2002","unstructured":"Honkala, I.S., Laihonen, T., Ranto, S.M.: On strongly identifying codes. Discrete Math. 254(1\u20133), 191\u2013205 (2002)","journal-title":"Discrete Math."},{"key":"8_CR10","unstructured":"Hopcroft, J.E., Motwani, R., Ullman, J.D.: Introduction to Automata Theory, Languages, and Computation - International Edition, 2nd edn. Addison-Wesley (2003)"},{"issue":"2","key":"8_CR11","doi-asserted-by":"crossref","first-page":"599","DOI":"10.1109\/18.661507","volume":"44","author":"MG Karpovsky","year":"1998","unstructured":"Karpovsky, M.G., Chakrabarty, K., Levitin, L.B.: 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"},{"issue":"1\u20132","key":"8_CR12","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1002\/rsa.20049","volume":"26","author":"JH Kim","year":"2005","unstructured":"Kim, J.H., Pikhurko, O., Spencer, J.H., Verbitsky, O.: How complex are random graphs in first order logic? Random Struct. Algorithms 26(1\u20132), 119\u2013145 (2005)","journal-title":"Random Struct. Algorithms"},{"key":"8_CR13","doi-asserted-by":"crossref","unstructured":"Kleene, S.C.: Representation of events in nerve nets and finite automata. In: Automata Studies (1956)","DOI":"10.1515\/9781400882618-002"},{"issue":"4","key":"8_CR14","first-page":"415","volume":"14","author":"M Laifenfeld","year":"2009","unstructured":"Laifenfeld, M., Trachtenberg, A., Cohen, R., Starobinski, D.: Joint monitoring and routing in wireless sensor networks using robust identifying codes. MONET 14(4), 415\u2013432 (2009)","journal-title":"MONET"},{"key":"8_CR15","unstructured":"Maheshwari, S.: Traversal marker placement problem are np-complete. In Research report no CU-CS-092-76, Dept. of Computer Science, University of Colorado at Boulder (1976)"},{"issue":"1","key":"8_CR16","doi-asserted-by":"crossref","first-page":"108","DOI":"10.1109\/T-C.1975.224091","volume":"24","author":"G Metze","year":"1975","unstructured":"Metze, G., Schertz, D.R., To, K., Whitney, G., Kime, C.R., Russell, J.D.: Comments on \u201cderivation of minimal complete sets of test-input sequences using boolean differences. IEEE Trans. Comput. 24(1), 108 (1975)","journal-title":"IEEE Trans. Comput."},{"key":"8_CR17","unstructured":"Meurdesoif, P., Pesneau, P., Vanderbeck, F.: Meter installation for monitoring network traffic. In: International Network Optimization Conference (INOC), Spa, Belgium, 2007"},{"issue":"4","key":"8_CR18","doi-asserted-by":"crossref","first-page":"983","DOI":"10.1137\/0906067","volume":"6","author":"B Moret","year":"1985","unstructured":"Moret, B., Shapiro, H.: On minimizing a set of tests. SIAM J. Sci. Stat. Comput. 6(4), 983\u20131003 (1985)","journal-title":"SIAM J. Sci. Stat. Comput."},{"issue":"9","key":"8_CR19","doi-asserted-by":"crossref","first-page":"917","DOI":"10.1109\/TC.1977.1674939","volume":"26","author":"PM Narendra","year":"1977","unstructured":"Narendra, P.M., Fukunaga, K.: A branch and bound algorithm for feature subset selection. IEEE Trans. Comput. 26(9), 917\u2013922 (1977)","journal-title":"IEEE Trans. Comput."},{"issue":"6","key":"8_CR20","doi-asserted-by":"crossref","first-page":"484","DOI":"10.1016\/j.dam.2010.12.010","volume":"159","author":"SJ Seo","year":"2011","unstructured":"Seo, S.J., Slater, P.J.: Open neighborhood locating-dominating in trees. Discrete Appl. Math. 159(6), 484\u2013489 (2011)","journal-title":"Discrete Appl. Math."},{"key":"8_CR21","doi-asserted-by":"crossref","unstructured":"Seo, S.J., Slater, P.J.: Open neighborhood locating-domination for infinite cylinders. In: ACM Southeast Regional Conference, pp. 334\u2013335 (2011)","DOI":"10.1145\/2016039.2016134"},{"key":"8_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1007\/978-3-540-30179-0_16","volume-title":"Intelligence in Communication Systems","author":"R Ungrangsi","year":"2004","unstructured":"Ungrangsi, R., Trachtenberg, A., Starobinski, D.: An implementation of indoor location detection systems based on identifying codes. In: Aagesen, F.A., Anutariya, C., Wuwongse, V. (eds.) INTELLCOMM 2004. LNCS, vol. 3283, pp. 175\u2013189. Springer, Heidelberg (2004)"},{"issue":"3","key":"8_CR23","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1007\/BF00453024","volume":"46","author":"B Holmes","year":"1980","unstructured":"Holmes, B., Willcox, W.R., Lapage, S.P.: A review of numerical methods in bacterial identification. Antonie van Leeuwenhoek 46(3), 233\u2013299 (1980)","journal-title":"Antonie van Leeuwenhoek"},{"issue":"3","key":"8_CR24","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1093\/comjnl\/15.3.263","volume":"15","author":"WR Willcox","year":"1972","unstructured":"Willcox, W.R., Lapage, S.P.: Automatic construction of diagnostic tables. Comput. J. 15(3), 263\u2013267 (1972)","journal-title":"Comput. J."}],"container-title":["Lecture Notes in Computer Science","Algorithmic Aspects in Information and Management"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-41168-2_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,24]],"date-time":"2017-06-24T13:43:58Z","timestamp":1498311838000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-41168-2_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319411675","9783319411682"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-41168-2_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}