7930 search results - page 630 / 1586 » Greedy in Approximation Algorithms |
179
click to vote
SIGECOM
2003
ACM
16 years 14 days ago
2003
ACM
Strategyproof cost-sharing mechanisms, lying in the core, that recover 1/a fraction of the cost, are presented for the set cover and facility location games: a=O(log n) for the fo...
222
click to vote
GECCO
2003
Springer
16 years 13 days ago
2003
Springer
Abstract. Population size for EvolutionaryAlgorithms is usually an empirical parameter. We study the population size from aspects of fitness landscapes’ ruggedness and Probably ...
216
click to vote
ADBIS
1994
Springer
15 years 11 months ago
1994
Springer
The data structures suitable for indexing of large spatial objects in databases are considered. Some generalizations of existing tree methods concerned approximation of spatial ob...
202
click to vote
UAI
2001
15 years 8 months ago
2001
We introduce a compact graph-theoretic representation for multi-party game theory. Our main result is a provably correct and efficient algorithm for computing approximate Nash equ...
183
click to vote
IPL
2008
15 years 7 months ago
2008
The Positive-Negative Partial Set Cover problem is introduced and its complexity, especially the hardness-of-approximation, is studied. The problem generalizes the Set Cover probl...