7129 search results - page 82 / 1426 » Approximation Algorithms for Treewidth |
124
click to vote
FOCS
2005
IEEE
15 years 8 months ago
2005
IEEE
We present a polynomial time algorithm based on semidefinite programming that, given a unique game of value 1 − O(1/ log n), satisfies a constant fraction of constraints, wher...
124
click to vote
SODA
1998
ACM
15 years 4 months ago
1998
ACM
We give two algorithms for finding all approximate matches of a pattern in a text, where the edit distance between the pattern and the matching text substring is at most k. The fir...
167
click to vote
IPCO
2001
15 years 4 months ago
2001
Problem (Extended Abstract) Cliff Stein David P. Wagner Dartmouth College Computer Science Technical Report TR2000-367 May 9, 2000 The problem of traversing a set of points in the...
128
click to vote
DATE
2002
IEEE
15 years 8 months ago
2002
IEEE
As system integration evolves and tighter design constraints must be met, it becomes necessary to account for the non-ideal behavior of all the elements in a system. For high-spee...
118
click to vote
INFOCOM
2009
IEEE
15 years 9 months ago
2009
IEEE
—Broadcasting is a fundamental operation in wireless networks and plays an important role in the communication protocol design. In multihop wireless networks, however, interferen...