2434 search results - page 10 / 487 » Algorithmic Randomness of Closed Sets |
128
click to vote
CPAIOR
2006
Springer
15 years 5 months ago
2006
Springer
We study domain filtering algorithms for open constraints, i.e., constraints that are not a priori defined on specific sets of variables. We present an efficient filtering algorith...
102
Voted
SODA
2010
ACM
15 years 11 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 ...
COMPGEOM
2006
ACM
15 years 7 months ago
2006
ACM
In this paper, we study the problem of L1-fitting a shape to a set of point, where the target is to minimize the sum of distances of the points to the shape, or alternatively the...
119
click to vote
SODA
2010
ACM
15 years 11 months ago
2010
ACM
Finding the largest independent set in a graph is a notoriously difficult NP-complete combinatorial optimization problem. Moreover, even for graphs with largest degree 3, no polyn...
125
click to vote
COMBINATORICS
2002
15 years 1 months ago
2002
We present a simple heuristic for finding a small connected dominating set of cubic graphs. The average-case performance of this heuristic, which is a randomised greedy algorithm,...