2310 search results - page 158 / 462 » Coloring Random Graphs |
139
Voted
JAIR
2007
15 years 2 months ago
2007
Exact Max-SAT solvers, compared with SAT solvers, apply little inference at each node of the proof tree. Commonly used SAT inference rules like unit propagation produce a simpliļ¬...
154
click to vote
ALGORITHMICA
2006
15 years 2 months ago
2006
Dai, Li, and Wu proposed Rule k, a localized approximation algorithm that attempts to find a small connected dominating set in a graph. In this paper we consider the "average...
111
Voted
LATIN
2010
Springer
15 years 9 months ago
2010
Springer
Abstract. We deļ¬ne the notion of diversity for families of ļ¬nite functions, and express the limitations of a simple class of holographic algorithms in terms of limitations on d...
120
Voted
COCO
2007
Springer
15 years 8 months ago
2007
Springer
We study a model of graph related formulae that we call the Constraint-Graph model. A constraintgraph is a labeled multi-graph (a graph where loops and parallel edges are allowed)...
126
click to vote
FCT
2007
Springer
15 years 6 months ago
2007
Springer
We study the multi-dimensional version of the bin packing problem with conflicts. We are given a set of squares V = {1, 2, . . . , n} with sides s1, s2, . . . , sn [0, 1] and a co...