Locality in distributed graph algorithms
SIAM Journal on Computing
Constant-time distributed dominating set approximation
Proceedings of the twenty-second annual symposium on Principles of distributed computing
The price of being near-sighted
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Distributed packing in planar graphs
Proceedings of the twentieth annual symposium on Parallelism in algorithms and architectures
Fast Distributed Approximations in Planar Graphs
DISC '08 Proceedings of the 22nd international symposium on Distributed Computing
Lower bounds for local approximation
PODC '12 Proceedings of the 2012 ACM symposium on Principles of distributed computing
Distributed 2-approximation algorithm for the semi-matching problem
DISC'12 Proceedings of the 26th international conference on Distributed Computing
ACM Computing Surveys (CSUR)
A strengthened analysis of a local algorithm for the minimum dominating set problem in planar graphs
Information Processing Letters
| Hi-index | 0.00 |
In research on distributed local algorithms it is commonly assumed that each vertex has a unique identifier in the entire graph. However, it turns out that in the case of certain classes of graphs (for example not lift-closed bounded degree graphs) identifiers are unnecessary and only a port ordering is needed [4]. One of the open issues was whether identifiers are essential in planar graphs. In this paper, we partially answer this question and we propose an algorithm which returns constant approximation of the MDS problem in the CONGEST model. The algorithm does not use any additional information about the structure of the graph and the nodes do not have unique identifiers. We hope that this paper will be helpful as a hint for further comparisons of the unique identifier model and the model with only a port numbering in other classes of graphs.