851 search results - page 12 / 171 » An exact algorithm for solving the vertex separator problem |
133
Voted
FSTTCS
2009
Springer
15 years 10 months ago
2009
Springer
Partial Cover problems are optimization versions of fundamental and well studied problems like Vertex Cover and Dominating Set. Here one is interested in covering (or dominating) ...
110
Voted
CPAIOR
2008
Springer
15 years 5 months ago
2008
Springer
We present a propagator that achieves MDD consistency for a separable equality over an MDD (multivalued decision diagram) store in pseudo-polynomial time. We integrate the propagat...
139
click to vote
QEST
2007
IEEE
15 years 10 months ago
2007
IEEE
Among the many stages of a simulation study, debugging a simulation model is the one that is hardly reported on but that may consume a considerable amount of time and effort. In t...
139
Voted
HEURISTICS
2006
15 years 3 months ago
2006
This paper investigates the capabilities of the Ant Colony Optimization (ACO) meta-heuristic for solving the maximum clique problem, the goal of which is to find a largest set of ...
168
Voted
ISPD
1997
ACM
15 years 7 months ago
1997
ACM
The wire sizing problem under inequality Elmore delay constraints is known to be posynomial, hence convex under an exponential variable-transformation. There are formal methods fo...