{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T17:57:47Z","timestamp":1743098267414,"version":"3.40.3"},"publisher-location":"Cham","reference-count":20,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030271947"},{"type":"electronic","value":"9783030271954"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"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":[[2019]]},"DOI":"10.1007\/978-3-030-27195-4_13","type":"book-chapter","created":{"date-parts":[[2019,8,1]],"date-time":"2019-08-01T09:03:14Z","timestamp":1564650194000},"page":"142-148","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["On Approximation Algorithm for the Edge Metric Dimension Problem"],"prefix":"10.1007","author":[{"given":"Yufei","family":"Huang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bo","family":"Hou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wen","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lidong","family":"Wu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Stephen","family":"Rainwater","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Suogang","family":"Gao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,8,1]]},"reference":[{"key":"13_CR1","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. Area Commun. 24, 2168\u20132181 (2006)","journal-title":"IEEE J. Sel. Area Commun."},{"issue":"2","key":"13_CR2","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1016\/j.jcss.2005.02.001","volume":"71","author":"P Berman","year":"2005","unstructured":"Berman, P., DasGupta, B., Kao, M.: Tight approximability results for test set problems in bioinformatics. J. Comput. Syst. Sci. 71(2), 145\u2013162 (2005)","journal-title":"J. Comput. Syst. Sci."},{"key":"13_CR3","doi-asserted-by":"publisher","first-page":"423","DOI":"10.1137\/050641867","volume":"21","author":"J C\u00e1ceres","year":"2007","unstructured":"C\u00e1ceres, J., et al.: On the metric dimension of Cartesian products of graphs. SIAM J. Discret. Math. 21, 423\u2013441 (2007)","journal-title":"SIAM J. Discret. Math."},{"issue":"2","key":"13_CR4","doi-asserted-by":"publisher","first-page":"423","DOI":"10.1137\/050641867","volume":"21","author":"Jos\u00e9 C\u00e1ceres","year":"2007","unstructured":"C\u00e1ceres, J., Hernando, C., Mora, M., Pelayo, I.M., Puertas, M.l., Seara, C., et al.: On the metric dimension of Cartesian products of graphs. SIAM J. Discret. Math. 21(2), 423\u2013441 (2007)","journal-title":"SIAM Journal on Discrete Mathematics"},{"key":"13_CR5","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1016\/j.endm.2009.11.004","volume":"35","author":"J C\u00e1ceres","year":"2009","unstructured":"C\u00e1ceres, J., Hernando, C., Mora, M., Pelayo, I., Puertas, M.: On the metric dimension of infinite graphs. Electron. Notes Discret. Math. 35, 15\u201320 (2009)","journal-title":"Electron. Notes Discret. Math."},{"key":"13_CR6","first-page":"349","volume":"88","author":"G Chappell","year":"2008","unstructured":"Chappell, G., Gimbel, J., Hartman, C.: Bounds on the metric and partition dimensions of a graph. Ars Combin. 88, 349\u2013366 (2008)","journal-title":"Ars Combin."},{"key":"13_CR7","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1016\/S0166-218X(00)00198-0","volume":"105","author":"G Chartrand","year":"2000","unstructured":"Chartrand, G., Eroh, L., Johnson, M., Oellermann, O.: Resolvability in graphs and the metric dimension of a graph. Discret. Appl. Math. 105, 99\u2013133 (2000)","journal-title":"Discret. Appl. Math."},{"key":"13_CR8","doi-asserted-by":"publisher","first-page":"526","DOI":"10.1016\/j.tcs.2015.03.048","volume":"609","author":"XJ Chen","year":"2016","unstructured":"Chen, X.J., Hu, X.D., Wang, C.J.: Approximation for the minimum cost doubly resolving set problem. Theor. Comput. Sci. 609, 526\u2013543 (2016)","journal-title":"Theor. Comput. Sci."},{"key":"13_CR9","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4614-1701-9","volume-title":"Design and Analysis of Approximation Algorithms","author":"DZ Du","year":"2011","unstructured":"Du, D.Z., Ko, K.I., Hu, X.D.: Design and Analysis of Approximation Algorithms, vol. 62. Springer, New York (2011). https:\/\/doi.org\/10.1007\/978-1-4614-1701-9"},{"key":"13_CR10","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"MR Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman, New York (1979)"},{"key":"13_CR11","first-page":"191","volume":"2","author":"F Harary","year":"1976","unstructured":"Harary, F., Melter, R.A.: On the metric dimension of a graph. Ars Combin. 2, 191\u2013195 (1976)","journal-title":"Ars Combin."},{"key":"13_CR12","doi-asserted-by":"publisher","first-page":"214","DOI":"10.1016\/j.jda.2011.12.010","volume":"14","author":"M Hauptmann","year":"2012","unstructured":"Hauptmann, M., Schmied, R., Viehmann, C.: Approximation complexity of metric dimension problem. J. Discret. Algorithms 14, 214\u2013222 (2012)","journal-title":"J. Discret. Algorithms"},{"key":"13_CR13","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. Discret. Appl. Math. 251, 204\u2013220 (2018)","journal-title":"Discret. Appl. Math."},{"key":"13_CR14","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1016\/0166-218X(95)00106-2","volume":"70","author":"S Khuller","year":"1996","unstructured":"Khuller, S., Raghavachari, B., Rosenfeld, A.: Landmarks in graphs. Discret. Appl. Math. 70, 217\u2013229 (1996)","journal-title":"Discret. Appl. Math."},{"issue":"7","key":"13_CR15","doi-asserted-by":"publisher","first-page":"2149","DOI":"10.1016\/j.cor.2008.08.002","volume":"36","author":"Jozef Kratica","year":"2009","unstructured":"Kratica, J., C\u0308angalovi\u0107, M., Kovac\u0308evi\u0107-Vujc\u0308i\u0107, V.: Computing minimal doubly resolving sets of graphs. Comput. Oper. Res. 36, 2149\u20132159 (2009)","journal-title":"Computers & Operations Research"},{"issue":"1","key":"13_CR16","first-page":"15","volume":"54","author":"M Baca","year":"2011","unstructured":"Baca, M., Baskoro, E.T., Salman, A.N.M., Saputro, S.W., Suprijanto, D.: The metric dimension of regular bipartite graphs. Bull. Math. Soc. Sci. Math. Roumanie 54(1), 15\u201328 (2011)","journal-title":"Bull. Math. Soc. Sci. Math. Roumanie"},{"key":"13_CR17","unstructured":"Slater, P.J.: Leaves of trees. In: Southeastern Conference on Combinatorics, Graph Theory, and Computing, Congressus Numerantium, vol. 14, pp. 549\u2013559 (1975)"},{"key":"13_CR18","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1016\/j.dam.2018.08.031","volume":"257","author":"EQ Zhu","year":"2019","unstructured":"Zhu, E.Q., Taranenko, A., Shao, Z.H., Xu, J.: On graphs with the maximum edge metric dimension. Discret. Appl. Math. 257, 317\u2013324 (2019)","journal-title":"Discret. Appl. Math."},{"key":"13_CR19","doi-asserted-by":"publisher","first-page":"2083","DOI":"10.1016\/j.disc.2018.04.010","volume":"341","author":"N Zubrilina","year":"2018","unstructured":"Zubrilina, N.: On edge dimension of a graph. Discret. Math. 341, 2083\u20132088 (2018)","journal-title":"Discret. Math."},{"key":"13_CR20","unstructured":"N. Zubrilina. On the edge metric dimension for the random graph (2016). arXiv:1612.06936 [math.CO]"}],"container-title":["Lecture Notes in Computer Science","Algorithmic Aspects in Information and Management"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-27195-4_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,7]],"date-time":"2024-03-07T15:16:23Z","timestamp":1709824583000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-27195-4_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030271947","9783030271954"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-27195-4_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"1 August 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"AAIM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Algorithmic Applications in Management","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Beijing","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6 August 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 August 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"aaim2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/theory.ict.ac.cn\/aaim2019\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}