On approximation algorithm for the edge metric dimension problem

Theoretical Computer Science(2021)

引用 0|浏览1
暂无评分
摘要
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⁡(log2⁡n), where n is the number of vertices in the graph G.
更多
查看译文
关键词
Edge metric generator,Edge metric dimension,Approximation algorithms,Submodular function
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要