Algorithms column: the vertex cover problem
ACM SIGACT News
Two Examples of Distributed Architecture for Solving Combinatorial Optimization Problems
PaCT '999 Proceedings of the 5th International Conference on Parallel Computing Technologies
Approximation Algorithms for Partial Covering Problems
ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
Primal-dual based distributed algorithms for vertex cover with semi-hard capacities
Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing
Fast distributed scheduling via primal-dual
Proceedings of the twentieth annual symposium on Parallelism in algorithms and architectures
Distributed weighted vertex cover via maximal matchings
ACM Transactions on Algorithms (TALG)
Distributed and parallel algorithms for weighted vertex cover and other covering problems
Proceedings of the 28th ACM symposium on Principles of distributed computing
Fast distributed algorithms via primal-dual
SIROCCO'07 Proceedings of the 14th international conference on Structural information and communication complexity
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
Parallel approximation algorithms for facility-location problems
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
Dominating sets of agents in visibility graphs: distributed algorithms for art gallery problems
Proceedings of the 9th International Conference on Autonomous Agents and Multiagent Systems: volume 1 - Volume 1
Approximated distributed minimum vertex cover algorithms for bounded degree graphs
COCOON'10 Proceedings of the 16th annual international conference on Computing and combinatorics
Linear-work greedy parallel approximate set cover and variants
Proceedings of the twenty-third annual ACM symposium on Parallelism in algorithms and architectures
Distributed weighted vertex cover via maximal matchings
COCOON'05 Proceedings of the 11th annual international conference on Computing and Combinatorics
| Hi-index | 0.01 |