3874 search results - page 156 / 775 » Approximation Algorithms for k-hurdle Problems |
195
click to vote
ICDE
2012
IEEE
13 years 4 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 ...
143
click to vote
ICALP
2004
Springer
15 years 7 months ago
2004
Springer
We study graph orientations that minimize the entropy of the in-degree sequence. The problem of finding such an orientation is an interesting special case of the minimum entropy ...
119
Voted
EOR
2008
15 years 1 months ago
2008
This article describes and compares three heuristics for a variant of the Steiner tree problem with revenues, which includes budget and hop constraints. First, a greedy method whi...
150
click to vote
ISAAC
2009
Springer
15 years 8 months ago
2009
Springer
We introduce a new probing problem: what is the minimum number of cameras at fixed positions necessary and sufficient to reconstruct any strictly convex polygon contained in a dis...
262
click to vote
AAIM
2011
Springer
14 years 5 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 ...