2698 search results - page 2 / 540 » Approximation Algorithms for the Weighted Independent Set Pr... |
SPAA
2010
ACM
15 years 2 months 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...
103
click to vote
COCOON
2007
Springer
15 years 3 months ago
2007
Springer
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...
AAECC
2006
Springer
14 years 9 months ago
2006
Springer
So-called nonadjacent representations are commonly used in elliptic curve cryptography to facilitate computing a scalar multiple of a point on an elliptic curve. A nonadjacent rep...
CORR
2008
Springer
14 years 9 months ago
2008
Springer
Abstract--In this paper, we investigate the use of messagepassing algorithms for the problem of finding the max-weight independent set (MWIS) in a graph. First, we study the perfor...
ALGORITHMICA
2010
14 years 9 months ago
2010
We divide a string into k segments, each with only one sort of symbols, so as to minimize the total number of exceptions. Motivations come from machine learning and data mining. F...