7129 search results - page 175 / 1426 » Approximation Algorithms for Treewidth |
116
Voted
IPL
2007
15 years 3 months ago
2007
The disk dimension of a planar graph G is the least number k for which G embeds in the plane minus k open disks, with every vertex on the boundary of some disk. Useful properties ...
125
Voted
ICASSP
2010
IEEE
15 years 3 months ago
2010
IEEE
We consider trellis-based algorithms for data estimation in digital communication systems. We present a general framework which includes approximate Viterbi algorithms like the M-...
113
Voted
FMCAD
2006
Springer
15 years 7 months ago
2006
Springer
Abstract-- This paper describes a symbolic algorithm for overapproximating reachability in Boolean programs with unbounded thread creation. The fix-point is detected by projecting ...
150
click to vote
CIAC
2010
Springer
15 years 7 months ago
2010
Springer
In this paper, we consider variants of the traveling salesman problem with precedence constraints. We characterize hard input instances for Christofides' algorithm and Hoogeve...