7129 search results - page 207 / 1426 » Approximation Algorithms for Treewidth |
154
click to vote
RECOMB
2000
Springer
15 years 7 months ago
2000
Springer
We present a lossless compression algorithm, GenCompress, for genetic sequences, based on searching for approximate repeats. Our algorithm achieves the best compression ratios for...
156
click to vote
CCCG
2010
15 years 5 months ago
2010
A dominating set of a graph G = (V, E) is a subset V V of the nodes such that for all nodes v V , either v V or a neighbor u of v is in V . Several routing protocols in ad hoc ...
152
click to vote
SODA
2010
ACM
15 years 2 months ago
2010
ACM
We give near-tight bounds for estimating the edit distance between two non-repetitive strings (Ulam distance) with constant approximation, in sub-linear time. For two strings of l...
142
click to vote
STOC
2005
ACM
15 years 9 months ago
2005
ACM
We present an asymptotic fully polynomial time approximation scheme for two-dimensional strip packing with rotations. In this problem, a set of rectangles need to be packed into a...
103
click to vote
CDC
2008
IEEE
15 years 10 months ago
2008
IEEE
— This paper studies consensus seeking over noisy networks with time-varying noise statistics. Stochastic approximation type algorithms can ensure consensus in mean square and wi...