1298 search results - page 13 / 260 » The online set cover problem |
FCT
2007
Springer
14 years 1 months ago
2007
Springer
We present new combinatorial approximation algorithms for k-set cover. Previous approaches are based on extending the greedy algorithm by efficiently handling small sets. The new a...
LREC
2008
13 years 8 months ago
2008
This article is interested in the problem of the linguistic content of a speech corpus. Depending on the target task, the phonological and linguistic content of the corpus is cont...
ESA
2004
Springer
14 years 23 days ago
2004
Springer
We consider a scenario where stops are to be placed along an already existing public transportation network in order to improve its attractiveness for the customers. The core probl...
ICALP
2005
Springer
14 years 27 days ago
2005
Springer
We reduce the approximation factor for Vertex Cover to 2 − Θ( 1√ log n ) (instead of the previous 2 − Θ(log log n log n ), obtained by Bar-Yehuda and Even [2], and by Moni...
TCBB
2011
13 years 2 months ago
2011
—Protein identification is a key and essential step in mass spectrometry (MS) based proteome research. To date, there are many protein identification strategies that employ eithe...