2698 search results - page 72 / 540 » Approximation Algorithms for the Weighted Independent Set Pr... |
134
Voted
JAR
2000
15 years 2 months ago
2000
In this paper, we show how Guided Local Search (GLS) can be applied to the SAT problem and show how the resulting algorithm can be naturally extended to solve the weighted MAX-SAT ...
121
Voted
ESA
2006
Springer
15 years 6 months ago
2006
Springer
The objective of this paper is to characterize classes of problems for which a greedy algorithm finds solutions provably close to optimum. To that end, we introduce the notion of k...
158
Voted
MST
2010
14 years 9 months ago
2010
We study local, distributed algorithms for the capacitated minimum dominating set (CapMDS) problem, which arises in various distributed network applications. Given a network graph...
111
click to vote
SODA
2010
ACM
15 years 12 months ago
2010
ACM
We propose a simple distributed algorithm for balancing indivisible tokens on graphs. The algorithm is completely deterministic, though it tries to imitate (and enhance) a random ...
123
click to vote
ISPASS
2008
IEEE
15 years 9 months ago
2008
IEEE
— This work addresses the problem of building representative subsets of benchmarks from an original large set of benchmarks, using statistical analysis techniques. The subsets sh...