Title
On Approximation Algorithm For The Edge Metric Dimension Problem
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 + lnn + ln(log(2) n), where nis the number of vertices in the graph G. (C) 2020 Elsevier B.V. All rights reserved.
Year
DOI
Venue
2021
10.1016/j.tcs.2020.05.005
THEORETICAL COMPUTER SCIENCE
Keywords
DocType
Volume
Edge metric generator, Edge metric dimension, Approximation algorithms, Submodular function
Journal
853
ISSN
Citations 
PageRank 
0304-3975
0
0.34
References 
Authors
0
6
Name
Order
Citations
PageRank
Yufei Huang1314.08
Bo Hou212.39
Wen Liu383.34
Wu Lidong412013.49
Stephen Rainwater510.70
Suogang Gao65912.78