Sciweavers

Share
110 search results - page 1 / 22
» Distributed Approximation Algorithms for Weighted Problems i...
Sort
View
COCOON
2007
Springer
9 years 4 months ago
Distributed Approximation Algorithms for Weighted Problems in Minor-Closed Families
We give efficient distributed approximation algorithms for weighted versions of the maximum matching problem and the minimum dominating set problem for graphs from minor-closed fam...
Andrzej Czygrinow, Michal Hanckowiak
ESA
2006
Springer
95views Algorithms» more  ESA 2006»
9 years 1 months ago
Distributed Almost Exact Approximations for Minor-Closed Families
Andrzej Czygrinow, Michal Hanckowiak
WDAG
2009
Springer
195views Algorithms» more  WDAG 2009»
9 years 4 months ago
A Local 2-Approximation Algorithm for the Vertex Cover Problem
We present a distributed 2-approximation algorithm for the minimum vertex cover problem. The algorithm is deterministic, and it runs in (∆ + 1)2 synchronous communication rounds,...
Matti Åstrand, Patrik Floréen, Valent...
PODC
2009
ACM
9 years 10 months ago
Distributed and parallel algorithms for weighted vertex cover and other covering problems
The paper presents distributed and parallel -approximation algorithms for covering problems, where is the maximum number of variables on which any constraint depends (for example...
Christos Koufogiannakis, Neal E. Young
PPAM
2007
Springer
9 years 4 months ago
A Parallel Approximation Algorithm for the Weighted Maximum Matching Problem
Abstract. We consider the problem of computing a weighted edge matching in a large graph using a parallel algorithm. This problem has application in several areas of combinatorial ...
Fredrik Manne, Rob H. Bisseling
books