7129 search results - page 243 / 1426 » Approximation Algorithms for Treewidth |
135
click to vote
JSA
2008
15 years 4 months ago
2008
In this paper, we present linear processor array architectures for flexible approximate string matching. These architectures are based on parallel realization of dynamic programmi...
186
click to vote
STOC
2007
ACM
16 years 4 months ago
2007
ACM
In the MINIMUM BOUNDED DEGREE SPANNING TREE problem, we are given an undirected graph with a degree upper bound Bv on each vertex v, and the task is to find a spanning tree of min...
150
click to vote
PODC
2012
ACM
13 years 6 months ago
2012
ACM
This paper proves a necessary and sufficient condition for the existence of iterative algorithms that achieve approximate Byzantine consensus in arbitrary directed graphs, where e...
252
click to vote
ICDE
2008
IEEE
16 years 5 months ago
2008
IEEE
Exploiting the concepts of social networking represents a novel approach to the approximate similarity query processing. We present a metric social network where relations between...
159
click to vote
WADS
2007
Springer
15 years 10 months ago
2007
Springer
We present a polynomial-time approximation scheme (PTAS) for the Steiner tree problem with polygonal obstacles in the plane with running time O(n log2 n), where n denotes the numb...