12519 search results - page 217 / 2504 » Approximation Problems Categories |
175
click to vote
DAM
1999
15 years 6 months ago
1999
This paper deals with the problem of constructing Steiner trees of minimum weight with diameter bounded by d, spanning a given set of vertices in a graph. Exact solutions or logar...
179
click to vote
SIAMCOMP
1998
15 years 6 months ago
1998
We build on the classical greedy sequential set cover algorithm, in the spirit of the primal-dual schema, to obtain simple parallel approximation algorithms for the set cover probl...
160
click to vote
ICDAR
2009
IEEE
15 years 4 months ago
2009
IEEE
Approximate text search is a basic technique to handle recognized text that contains recognition errors. This paper proposes an approximate string search for recognized text using...
186
click to vote
WG
2007
Springer
16 years 18 days ago
2007
Springer
A cycle cover of a graph is a set of cycles such that every vertex is part of exactly one cycle. An L-cycle cover is a cycle cover in which the length of every cycle is in the set ...
167
click to vote
AAAI
1992
15 years 7 months ago
1992
models require the identi cation of abstractions and approximations that are well suited to the task at hand. In this paper we analyze the problem of automatically selecting adequ...