3875 search results - page 65 / 775 » Approximation algorithms for the 0-extension problem |
129
click to vote
AAIM
2010
Springer
15 years 7 months ago
2010
Springer
Abstract. This paper considers a generalization of the capacitated spanning tree, in which some of the nodes have capacity K, and the others have capacity k < K. We prove that t...
222
click to vote
ICDE
2012
IEEE
13 years 6 months ago
2012
IEEE
— We consider the approximate string membership checking (ASMC) problem of extracting all the strings or substrings in a document that approximately match some string in a given ...
239
click to vote
APPROX
2005
Springer
15 years 10 months ago
2005
Springer
Abstract. In this paper we introduce a new technique for approximation schemes for geometrical optimization problems. As an example problem, we consider the following variant of th...
142
click to vote
GBRPR
2005
Springer
15 years 10 months ago
2005
Springer
This work discusses the issue of approximation in point set matching problems. In general, one may have two classes of approximations when tackling a matching problem: a representa...
310
click to vote
AAIM
2011
Springer
14 years 8 months ago
2011
Springer
A star forest is a collection of vertex-disjoint trees of depth at most 1, and its size is the number of leaves in all its components. A spanning star forest of a given graph G is ...