455 search results - page 12 / 91 » A local approximation algorithm for maximum weight matching |
SPAA
2010
ACM
14 years 6 days ago
2010
ACM
We present a distributed algorithm that finds a maximal edge packing in O(∆ + log∗ W) synchronous communication rounds in a weighted graph, independent of the number of nodes...
SAT
2010
Springer
13 years 5 months ago
2010
Springer
Algorithms based on local search are popular for solving many optimization problems including the maximum satisfiability problem (MAXSAT). With regard to MAXSAT, the state of the ...
WG
2005
Springer
14 years 26 days ago
2005
Springer
In unweighted case, approximation ratio for the independent set problem has been analyzed in terms of the graph parameters, such as the number of vertices, maximum degree, and aver...
ICPR
2004
IEEE
14 years 8 months ago
2004
IEEE
A normalized, power-weighted averaging filter (NPF) is a very good approximation to the well-know local maximum and minimum filters along the object edges and offers noise reducti...
WADS
2005
Springer
14 years 26 days ago
2005
Springer
Abstract. In this paper we consider a generalization of the edge dominating set (EDS) problem, in which each edge e needs to be covered be times and refer to this as the b-EDS prob...