65 search results - page 2 / 13 » Nature Reserve Selection Problem: A Tight Approximation Algo... |
154
Voted
SIGECOM
2009
ACM
15 years 10 months ago
2009
ACM
The literature on algorithmic mechanism design is mostly concerned with game-theoretic versions of optimization problems to which standard economic money-based mechanisms cannot b...
133
Voted
WIOPT
2010
IEEE
15 years 1 months ago
2010
IEEE
We consider the problem of providing opportunistic spectrum access to secondary users in wireless cellular networks. From the standpoint of spectrum license holders, achieving ben...
134
Voted
FCT
2003
Springer
15 years 8 months ago
2003
Springer
Abstract. The NP-complete Distinguishing Substring Selection problem (DSSS for short) asks, given a set of “good” strings and a set of “bad” strings, for a solution string ...
124
Voted
STACS
2007
Springer
15 years 9 months ago
2007
Springer
We present a (2 3 − o(1))-approximation algorithm for the partial latin square extension (PLSE) problem. This improves the current best bound of 1 − 1 e due to Gomes, Regis, an...
147
Voted
COCOON
2005
Springer
15 years 5 months ago
2005
Springer
We consider a variation of the classical problem of finding prices which guarantee equilibrium in linear markets consisting of divisible goods and agents with money. Specificall...