Skip to main content
SpringerLink
Log in
Book cover

International Conference on Algorithmic Applications in Management

AAIM 2019: Algorithmic Aspects in Information and Management pp 142–148Cite as

On Approximation Algorithm for the Edge Metric Dimension Problem

  • Conference paper
  • First Online:

  • 520 Accesses

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 11640))

Abstract

In this paper, we study the edge metric dimension problem (EMDP). We establish a potential function and give a corresponding greedy algorithm with approximation ratio \(1+\ln n+\ln (\log _2 n)\), where n is the number of vertices in the graph G.

This is a preview of subscription content, log in via an institution.

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

References

  1. Beerliova, Z., et al.: Network discovery and verification. IEEE J. Sel. Area Commun. 24, 2168–2181 (2006)

    Article  Google Scholar 

  2. Berman, P., DasGupta, B., Kao, M.: Tight approximability results for test set problems in bioinformatics. J. Comput. Syst. Sci. 71(2), 145–162 (2005)

    Article  MathSciNet  Google Scholar 

  3. Cáceres, J., et al.: On the metric dimension of Cartesian products of graphs. SIAM J. Discret. Math. 21, 423–441 (2007)

    Article  MathSciNet  Google Scholar 

  4. Cáceres, 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–441 (2007)

    Article  MathSciNet  Google Scholar 

  5. Cáceres, J., Hernando, C., Mora, M., Pelayo, I., Puertas, M.: On the metric dimension of infinite graphs. Electron. Notes Discret. Math. 35, 15–20 (2009)

    Article  MathSciNet  Google Scholar 

  6. Chappell, G., Gimbel, J., Hartman, C.: Bounds on the metric and partition dimensions of a graph. Ars Combin. 88, 349–366 (2008)

    MathSciNet  MATH  Google Scholar 

  7. Chartrand, G., Eroh, L., Johnson, M., Oellermann, O.: Resolvability in graphs and the metric dimension of a graph. Discret. Appl. Math. 105, 99–133 (2000)

    Article  MathSciNet  Google Scholar 

  8. Chen, X.J., Hu, X.D., Wang, C.J.: Approximation for the minimum cost doubly resolving set problem. Theor. Comput. Sci. 609, 526–543 (2016)

    Article  MathSciNet  Google Scholar 

  9. 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

    Book  Google Scholar 

  10. Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman, New York (1979)

    MATH  Google Scholar 

  11. Harary, F., Melter, R.A.: On the metric dimension of a graph. Ars Combin. 2, 191–195 (1976)

    MATH  Google Scholar 

  12. Hauptmann, M., Schmied, R., Viehmann, C.: Approximation complexity of metric dimension problem. J. Discret. Algorithms 14, 214–222 (2012)

    Article  MathSciNet  Google Scholar 

  13. Kelenc, A., Tratnik, N., Yero, I.G.: Uniquely identifying the edges of a graph: the edge metric dimension. Discret. Appl. Math. 251, 204–220 (2018)

    Article  MathSciNet  Google Scholar 

  14. Khuller, S., Raghavachari, B., Rosenfeld, A.: Landmarks in graphs. Discret. Appl. Math. 70, 217–229 (1996)

    Article  MathSciNet  Google Scholar 

  15. Kratica, J., C̈angalović, M., Kovac̈ević-Vujc̈ić, V.: Computing minimal doubly resolving sets of graphs. Comput. Oper. Res. 36, 2149–2159 (2009)

    Article  MathSciNet  Google Scholar 

  16. 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–28 (2011)

    MathSciNet  MATH  Google Scholar 

  17. Slater, P.J.: Leaves of trees. In: Southeastern Conference on Combinatorics, Graph Theory, and Computing, Congressus Numerantium, vol. 14, pp. 549–559 (1975)

    Google Scholar 

  18. Zhu, E.Q., Taranenko, A., Shao, Z.H., Xu, J.: On graphs with the maximum edge metric dimension. Discret. Appl. Math. 257, 317–324 (2019)

    Article  MathSciNet  Google Scholar 

  19. Zubrilina, N.: On edge dimension of a graph. Discret. Math. 341, 2083–2088 (2018)

    Article  MathSciNet  Google Scholar 

  20. N. Zubrilina. On the edge metric dimension for the random graph (2016). arXiv:1612.06936 [math.CO]

Download references

Acknowledgement

The authors would like to thank Professor Ding-Zhu Du for his many valuable advices during their study of approximation algorithm. This work was supported by the NSF of China (No. 11471097), Hebei Province Foundation for Returnees (CL201714) and Overseas Expertise Introduction Program of Hebei Auspices (25305008).

Author information

Authors and Affiliations

  1. College of Mathematics and Information Science, Hebei Normal University, Shijiazhuang, 050024, People’s Republic of China

    Yufei Huang, Bo Hou, Wen Liu & Suogang Gao

  2. Department of Computer Science, Unibersity of Texas at Tyler, Tyler, USA

    Lidong Wu & Stephen Rainwater

Authors
  1. Yufei Huang
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Bo Hou
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Wen Liu
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Lidong Wu
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Stephen Rainwater
    View author publications

    You can also search for this author in PubMed Google Scholar

  6. Suogang Gao
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Suogang Gao .

Editor information

Editors and Affiliations

  1. The University of Texas at Dallas, Richardson, TX, USA

    Ding-Zhu Du

  2. Hefei University of Technology, Hefei, China

    Lian Li

  3. Institute of Computing Technology, Chinese Academy of Sciences, Beijing, China

    Xiaoming Sun

  4. Institute of Computing Technology, Chinese Academy of Sciences, Beijing, China

    Jialin Zhang

Rights and permissions

Reprints and permissions

Copyright information

© 2019 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Huang, Y., Hou, B., Liu, W., Wu, L., Rainwater, S., Gao, S. (2019). On Approximation Algorithm for the Edge Metric Dimension Problem. In: Du, DZ., Li, L., Sun, X., Zhang, J. (eds) Algorithmic Aspects in Information and Management. AAIM 2019. Lecture Notes in Computer Science(), vol 11640. Springer, Cham. https://doi.org/10.1007/978-3-030-27195-4_13

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-27195-4_13

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-27194-7

  • Online ISBN: 978-3-030-27195-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation