1279 search results - page 167 / 256 » Approximation Algorithms for Min-Max Generalization Problems |
ICALP
2011
Springer
13 years 12 days ago
2011
Springer
In [13], Erd˝os et al. defined the local chromatic number of a graph as the minimum number of colors that must appear within distance 1 of a vertex. For any ∆ ≥ 2, there are ...
INFOCOM
2012
IEEE
11 years 11 months ago
2012
IEEE
—In this paper, we tackle the spectrum allocation problem in cognitive radio (CR) networks with time-frequency flexibility consideration using combinatorial auction. Different f...
SIGECOM
2008
ACM
13 years 8 months ago
2008
ACM
We provide tight information-theoretic lower bounds for the welfare maximization problem in combinatorial auctions. In this problem, the goal is to partition m items among k bidde...
ALGORITHMS
2010
13 years 6 months ago
2010
Increasingly encompassing models have been suggested for our world. Theories range from generally accepted to increasingly speculative to apparently bogus. The progression of theo...
GIS
2007
ACM
14 years 10 months ago
2007
ACM
This work addresses the problem of obtaining the degree of similarity between trajectories of moving objects. Typically, a Moving Objects Database (MOD) contains sequences of (loc...