7150 search results - page 49 / 1430 » An Approximation Algorithm for Approximation Rank |
86
Voted
CORR
2008
Springer
15 years 18 days ago
2008
Springer
We present a local algorithm (constant-time distributed algorithm) for finding a 3-approximate vertex cover in bounded-degree graphs. The algorithm is deterministic, and no auxili...
124
click to vote
SIGIR
2010
ACM
15 years 21 days ago
2010
ACM
The Quantum Probability Ranking Principle (QPRP) has been recently proposed, and accounts for interdependent document relevance when ranking. However, to be instantiated, the QPRP...
111
click to vote
RSFDGRC
2005
Springer
15 years 6 months ago
2005
Springer
In this paper, the concept of a granulation order is proposed in an information system. The positive approximation of a set under a granulation order is defined. Some properties o...
86
Voted
STOC
2006
ACM
16 years 25 days ago
2006
ACM
125
click to vote
CORR
2011
Springer
14 years 7 months ago
2011
Springer
In Combinatorial Public Projects, there is a set of projects that may be undertaken, and a set of selfinterested players with a stake in the set of projects chosen. A public plann...