4894 search results - page 91 / 979 » The Guarding Problem - Complexity and Approximation |
176
click to vote
SCL
2008
15 years 6 months ago
2008
ABSTRACT: Linear function approximations based on random projections are proposed and justified for a class of fixed point and minimization problems. KEY WORDS: random projections,...
191
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
We introduce a problem that is a common generalization of the uncapacitated facility location (UFL) and minimum latency (ML) problems, where facilities not only need to be opened ...
158
click to vote
EVOW
2009
Springer
15 years 4 months ago
2009
Springer
Abstract. In this paper we propose a new benchmark problem for dynamic combinatorial optimisation. Unlike most previous benchmarks, we focus primarily on the underlying dynamics of...
198
click to vote
INFOCOM
2011
IEEE
14 years 9 months ago
2011
IEEE
—Cognitive radios (CRs) can mitigate the impending spectrum scarcity problem by utilizing their capability of accessing licensed spectrum bands opportunistically. While most exis...
138
click to vote
ALGORITHMICA
2006
15 years 6 months ago
2006
For multi-criteria problems and problems with poorly characterized objective, it is often desirable to simultaneously approximate the optimum solution for a large class of objecti...