7129 search results - page 198 / 1426 » Approximation Algorithms for Treewidth |
108
Voted
CP
2008
Springer
15 years 5 months ago
2008
Springer
We present an incremental refinement algorithm for approximate compilation of constraint satisfaction models into multivalued decision diagrams (MDDs). The algorithm uses a vertex ...
162
click to vote
TCC
2012
Springer
13 years 11 months ago
2012
Springer
In this paper we study the problem of approximately releasing the cut function of a graph while preserving differential privacy, and give new algorithms (and new analyses of exis...
118
Voted
STOC
2005
ACM
16 years 4 months ago
2005
ACM
We consider the problem of approximately counting integral flows in a network. We show that there is an fpras based on volume estimation if all capacities are sufficiently large, ...
149
click to vote
COMPGEOM
2000
ACM
15 years 8 months ago
2000
ACM
We present an (1+ε)-approximation algorithm for computing the minimum-spanning tree of points in a planar arrangement of lines, where the metric is the number of crossings betwee...
140
click to vote
CORR
2007
Springer
15 years 3 months ago
2007
Springer
: We propose a new algorithm to the problem of polygonal curve approximation based on a multiresolution approach. This algorithm is suboptimal but still maintains some optimality b...