114 search results - page 6 / 23 » Engineering Algorithms for Approximate Weighted Matching |
ISAAC
2004
Springer
14 years 3 months ago
2004
Springer
We study complexity and approximation of min weighted node coloring in planar, bipartite and split graphs. We show that this problem is NP-complete in planar graphs, even if they a...
ISAAC
2001
Springer
14 years 2 months ago
2001
Springer
A fragmentary pattern is a multiset of non-empty strings, and it matches a string w if all the strings in it occur within w without any overlaps. We study some fundamental issues o...
WWW
2006
ACM
14 years 10 months ago
2006
ACM
We revisit a problem introduced by Bharat and Broder almost a decade ago: how to sample random pages from the corpus of documents indexed by a search engine, using only the search...
ESA
2005
Springer
14 years 3 months ago
2005
Springer
Let A and B be two sets of m resp. n weighted points in the plane, with m ≤ n. We present (1 + ) and (2+ )-approximation algorithms for the minimum Euclidean Earth Mover’s Dis...
ISPAN
1997
IEEE
14 years 2 months ago
1997
IEEE
Abstract- String matching problem received much attention over the years due to its importance in various applications such as text/file comparison, DNA sequencing, search engines,...