{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,28]],"date-time":"2025-09-28T12:44:13Z","timestamp":1759063453566,"version":"3.40.3"},"publisher-location":"Cham","reference-count":20,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030392185"},{"type":"electronic","value":"9783030392192"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-39219-2_3","type":"book-chapter","created":{"date-parts":[[2020,1,24]],"date-time":"2020-01-24T19:09:24Z","timestamp":1579892964000},"page":"28-40","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Monitoring the Edges of a Graph Using Distances"],"prefix":"10.1007","author":[{"given":"Florent","family":"Foucaud","sequence":"first","affiliation":[]},{"given":"Ralf","family":"Klasing","sequence":"additional","affiliation":[]},{"given":"Mirka","family":"Miller","sequence":"additional","affiliation":[]},{"given":"Joe","family":"Ryan","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,1,24]]},"reference":[{"key":"3_CR1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-58412-1","volume-title":"Complexity and Approximation: Combinatorial Optimization Problems and Their Approximability Properties","author":"G Ausiello","year":"1999","unstructured":"Ausiello, G., Crescenzi, P., Gambosi, G., Kann, V., Marchetti-Spaccamela, A., Protasi, M.: Complexity and Approximation: Combinatorial Optimization Problems and Their Approximability Properties. Springer, Heidelberg (1999). \nhttps:\/\/doi.org\/10.1007\/978-3-642-58412-1"},{"issue":"1","key":"3_CR2","doi-asserted-by":"publisher","first-page":"234","DOI":"10.1016\/j.jcss.2014.06.003","volume":"81","author":"E Bampas","year":"2015","unstructured":"Bampas, E., Bil\u00f2, D., Drovandi, G., Gual\u00e0, L., Klasing, R., Proietti, G.: Network verification via routing table queries. J. Comput. Syst. Sci. 81(1), 234\u2013248 (2015)","journal-title":"J. Comput. Syst. Sci."},{"issue":"12","key":"3_CR3","doi-asserted-by":"publisher","first-page":"2168","DOI":"10.1109\/JSAC.2006.884015","volume":"24","author":"Z Beerliova","year":"2006","unstructured":"Beerliova, Z., et al.: Network discovery and verification. IEEE J. Sel. Areas Commun. 24(12), 2168\u20132181 (2006)","journal-title":"IEEE J. Sel. Areas Commun."},{"issue":"14\u201315","key":"3_CR4","doi-asserted-by":"publisher","first-page":"1626","DOI":"10.1016\/j.tcs.2010.01.010","volume":"411","author":"D Bil\u00f2","year":"2010","unstructured":"Bil\u00f2, D., Erlebach, T., Mihal\u00e1k, M., Widmayer, P.: Discovery of network properties with all-shortest-paths queries. Theoret. Comput. Sci. 411(14\u201315), 1626\u20131637 (2010)","journal-title":"Theoret. Comput. Sci."},{"issue":"2","key":"3_CR5","doi-asserted-by":"publisher","first-page":"216","DOI":"10.1016\/j.ic.2005.05.001","volume":"201","author":"J Chen","year":"2005","unstructured":"Chen, J., et al.: Tight lower bounds for certain parameterized NP-hard problems. Inf. Comput. 201(2), 216\u2013231 (2005)","journal-title":"Inf. Comput."},{"issue":"1","key":"3_CR6","doi-asserted-by":"publisher","first-page":"6","DOI":"10.1016\/j.tcs.2005.12.009","volume":"355","author":"L Dall\u2019Asta","year":"2006","unstructured":"Dall\u2019Asta, L., Alvarez-Hamelin, J.I., Barrat, A., V\u00e1zquez, A., Vespignani, A.: Exploring networks with traceroute-like probes: theory and simulations. Theoret. Comput. Sci. 355(1), 6\u201324 (2006)","journal-title":"Theoret. Comput. Sci."},{"key":"3_CR7","doi-asserted-by":"crossref","unstructured":"Dinur, I., Steurer, D.: Analytical approach to parallel repetition. In: Proceedings of the Forty-Sixth Annual ACM Symposium on Theory of Computing, STOC 2014, pp. 624\u2013633 (2014)","DOI":"10.1145\/2591796.2591884"},{"key":"3_CR8","series-title":"Texts in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4471-5559-1","volume-title":"Fundamentals of Parameterized Complexity","author":"RG Downey","year":"2013","unstructured":"Downey, R.G., Fellows, M.R.: Fundamentals of Parameterized Complexity. TCS. Springer, London (2013). \nhttps:\/\/doi.org\/10.1007\/978-1-4471-5559-1"},{"issue":"4","key":"3_CR9","doi-asserted-by":"publisher","first-page":"1130","DOI":"10.1007\/s00453-014-9896-2","volume":"72","author":"L Epstein","year":"2015","unstructured":"Epstein, L., Levin, A., Woeginger, G.J.: The (weighted) metric dimension of graphs: hard and easy cases. Algorithmica 72(4), 1130\u20131171 (2015)","journal-title":"Algorithmica"},{"issue":"4","key":"3_CR10","doi-asserted-by":"publisher","first-page":"826","DOI":"10.1137\/0132071","volume":"32","author":"MR Garey","year":"1977","unstructured":"Garey, M.R., Johnson, D.S.: The rectilinear Steiner tree problem is NP-complete. SIAM J. Appl. Math. 32(4), 826\u2013834 (1977)","journal-title":"SIAM J. Appl. Math."},{"key":"3_CR11","unstructured":"Govindan, R., Tangmunarunkit, H.: Heuristics for Internet map discovery. In: Proceedings of the 19th IEEE International Conference on Computer Communications, INFOCOM 2000, pp. 1371\u20131380 (2000)"},{"key":"3_CR12","first-page":"191","volume":"2","author":"F Harary","year":"1976","unstructured":"Harary, F., Melter, R.A.: On the metric dimension of a graph. Ars Comb. 2, 191\u2013195 (1976)","journal-title":"Ars Comb."},{"key":"3_CR13","series-title":"Texts in Theoretical Computer Science. An EATCS Series","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-05269-3","volume-title":"Algorithmics for Hard Problems: Introduction to Combinatorial Optimization, Randomization, Approximation, and Heuristics","author":"J Hromkovi\u010d","year":"2004","unstructured":"Hromkovi\u010d, J.: Algorithmics for Hard Problems: Introduction to Combinatorial Optimization, Randomization, Approximation, and Heuristics. Texts in Theoretical Computer Science. An EATCS Series, 2nd edn. Springer, Heidelberg (2004). \nhttps:\/\/doi.org\/10.1007\/978-3-662-05269-3","edition":"2"},{"key":"3_CR14","doi-asserted-by":"publisher","first-page":"256","DOI":"10.1016\/S0022-0000(74)80044-9","volume":"9","author":"DS Johnson","year":"1974","unstructured":"Johnson, D.S.: Approximation algorithms for combinatorial problems. J. Comput. Syst. Sci. 9, 256\u2013278 (1974)","journal-title":"J. Comput. Syst. Sci."},{"key":"3_CR15","doi-asserted-by":"publisher","first-page":"204","DOI":"10.1016\/j.dam.2018.05.052","volume":"251","author":"A Kelenc","year":"2018","unstructured":"Kelenc, A., Tratnik, N., Yero, I.G.: Uniquely identifying the edges of a graph: the edge metric dimension. Discrete Appl. Math. 251, 204\u2013220 (2018)","journal-title":"Discrete Appl. Math."},{"key":"3_CR16","doi-asserted-by":"publisher","first-page":"1225","DOI":"10.1515\/math-2017-0101","volume":"15","author":"P Manuel","year":"2017","unstructured":"Manuel, P., Klav\u017ear, S., Xavier, A., Arokiaraj, A., Thomas, E.: Strong edge geodetic problem in networks. Open Math. 15, 1225\u20131235 (2017)","journal-title":"Open Math."},{"key":"3_CR17","doi-asserted-by":"publisher","DOI":"10.1093\/acprof:oso\/9780198566076.001.0001","volume-title":"Invitation to Fixed-Parameter Algorithms","author":"R Niedermeier","year":"2006","unstructured":"Niedermeier, R.: Invitation to Fixed-Parameter Algorithms. Oxford University Press, Oxford (2006)"},{"key":"3_CR18","doi-asserted-by":"publisher","first-page":"356","DOI":"10.1016\/j.dam.2006.06.009","volume":"155","author":"OR Oellermann","year":"2007","unstructured":"Oellermann, O.R., Peters-Fransen, J.: The strong metric dimension of graphs and digraphs. Discrete Appl. Math. 155, 356\u2013364 (2007)","journal-title":"Discrete Appl. Math."},{"issue":"2","key":"3_CR19","doi-asserted-by":"publisher","first-page":"383","DOI":"10.1287\/moor.1030.0070","volume":"29","author":"A Seb\u0151","year":"2004","unstructured":"Seb\u0151, A., Tannier, E.: On metric generators of graphs. Math. Oper. Res. 29(2), 383\u2013393 (2004)","journal-title":"Math. Oper. Res."},{"key":"3_CR20","first-page":"549","volume":"14","author":"PJ Slater","year":"1975","unstructured":"Slater, P.J.: Leaves of trees. Congr. Numerantium 14, 549\u2013559 (1975)","journal-title":"Congr. Numerantium"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-39219-2_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,25]],"date-time":"2020-01-25T00:01:32Z","timestamp":1579910492000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-39219-2_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030392185","9783030392192"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-39219-2_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"24 January 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CALDAM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Conference on Algorithms and Discrete Applied Mathematics","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Hyderabad","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"India","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13 February 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 February 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"caldam2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.iith.ac.in\/~caldam2020\/index.php","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}