168 search results - page 5 / 34 » On Nontrivial Approximation of CSPs |
HYBRID
2000
Springer
14 years 1 months ago
2000
Springer
In this paper we describe an experimental system called d=dt for approximating reachable states for hybrid systems whose continuous dynamics is de ned by linear di erential equatio...
MP
2011
13 years 5 months ago
2011
Integer programs defined by two equations with two free integer variables and nonnegative continuous variables have three types of nontrivial facets: split, triangle or quadrilat...
AAAI
1997
13 years 11 months ago
1997
We present empirical evidence that the distribution of e ort required to solve CSPs randomly generated at the 50% satis able point, when using a backtracking algorithm, can be app...
MST
2010
13 years 5 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...
CORR
2012
Springer
12 years 6 months ago
2012
Springer
A distance oracle is a compact representation of the shortest distance matrix of a graph. It can be queried to retrieve approximate distances and corresponding paths between any p...