7129 search results - page 259 / 1426 » Approximation Algorithms for Treewidth |
147
click to vote
ICDE
2011
IEEE
14 years 8 months ago
2011
IEEE
— An approximate string query is to find from a collection of strings those that are similar to a given query string. Answering such queries is important in many applications su...
140
click to vote
SODA
2003
ACM
15 years 5 months ago
2003
ACM
We present a hierarchical scheme for efficiently maintaining all-pairs approximate shortest-paths in undirected unweighted graphs under deletions of edges. An α-approximate short...
149
click to vote
ICIP
2000
IEEE
16 years 5 months ago
2000
IEEE
This paper describes an algorithm that achieves an approximately optimal assignment of forward error correction to progressive data within the unequal loss protection framework [1...
123
click to vote
STOC
2001
ACM
16 years 4 months ago
2001
ACM
Let G = (V, E) be an undirected weighted graph with |V | = n and |E| = m. Let k 1 be an integer. We show that G = (V, E) can be preprocessed in O(kmn1/k ) expected time, construc...
152
click to vote
SODA
2010
ACM
16 years 1 months ago
2010
ACM
In the capacitated vehicle routing problem, introduced by Dantzig and Ramser in 1959, we are given the locations of n customers and a depot, along with a vehicle of capacity k, an...