1933 search results - page 11 / 387 » Improved Algorithms for the Feedback Vertex Set Problems |
ECIR
2007
Springer
13 years 9 months ago
2007
Springer
Abstract. Relevance feedback, which uses the terms in relevant documents to enrich the user’s initial query, is an effective method for improving retrieval performance. An assoc...
STOC
2002
ACM
14 years 7 months ago
2002
ACM
The Minimum Vertex Cover problem is the problem of, given a graph, finding a smallest set of vertices that touches all edges. We show that it is NP-hard to approximate this proble...
CIKM
2009
Springer
14 years 2 months ago
2009
Springer
Relevance Feedback has proven very effective for improving retrieval accuracy. A difficult yet important problem in all relevance feedback methods is how to optimally balance the...
23
Voted
CORR
2004
Springer
13 years 7 months ago
2004
Springer
Abstract. The phylogenetic tree construction is to infer the evolutionary relationship between species from the experimental data. However, the experimental data are often imperfec...
COCO
2009
Springer
14 years 2 months ago
2009
Springer
We study the inapproximability of Vertex Cover and Independent Set on degree d graphs. We prove that: • Vertex Cover is Unique Games-hard to approximate to within a factor 2−(...