Computing on an anonymous ring
Journal of the ACM (JACM)
Approximation algorithms for NP-complete problems on planar graphs
Journal of the ACM (JACM)
SIAM Journal on Computing
Computing on Anonymous Networks: Part I-Characterizing the Solvable Cases
IEEE Transactions on Parallel and Distributed Systems
NC-approximation schemes for NP- and PSPACE-hard problems for geometric graphs
Journal of Algorithms
On the distributed complexity of computing maximal matchings
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
A 2-approximation algorithm for the minimum weight edge dominating set problem
Discrete Applied Mathematics
On the Distributed Complexity of Computing Maximal Matchings
SIAM Journal on Discrete Mathematics
An Effective Characterization of Computability in Anonymous Networks
DISC '01 Proceedings of the 15th International Conference on Distributed Computing
Local and global properties in networks of processors (Extended Abstract)
STOC '80 Proceedings of the twelfth annual ACM symposium on Theory of computing
Some simple distributed algorithms for sparse networks
Distributed Computing
How to meet in anonymous network
Theoretical Computer Science
A simple local 3-approximation algorithm for vertex cover
Information Processing Letters
Fast distributed approximation algorithms for vertex cover and set cover in anonymous networks
Proceedings of the twenty-second annual ACM symposium on Parallelism in algorithms and architectures
A local 2-approximation algorithm for the vertex cover problem
DISC'09 Proceedings of the 23rd international conference on Distributed computing
Analysing local algorithms in location-aware quasi-unit-disk graphs
Discrete Applied Mathematics
Lower bounds for local approximation
PODC '12 Proceedings of the 2012 ACM symposium on Principles of distributed computing
ACM Computing Surveys (CSUR)
Lower bounds for local approximation
Journal of the ACM (JACM)
| Hi-index | 0.00 |
An edge dominating set for a graph G is a set D of edges such that each edge of G is in D or adjacent to at least one edge in D. This work studies deterministic distributed approximation algorithms for finding minimum-size edge dominating sets. The focus is on anonymous port-numbered networks: there are no unique identifiers, but a node of degree d can refer to its neighbours by integers 1, 2, ..., d. The present work shows that in the port-numbering model, edge dominating sets can be approximated as follows: in d-regular graphs, to within 4-6/(d+1) for an odd d and to within 4-2/d for an even d; and in graphs with maximum degree Δ, to within 4-2/(Δ-1) for an odd Δ and to within 4-2/Δ for an even Δ. These approximation ratios are tight for all values of d and Δ: there are matching lower bounds.