12519 search results - page 145 / 2504 » Approximation Problems Categories |
197
click to vote
FOCS
2008
IEEE
15 years 7 months ago
2008
IEEE
In the mobile facility location problem, which is a variant of the classical Uncapacitated Facility Location and kMedian problems, each facility and client is assigned to a start ...
195
click to vote
ESA
2005
Springer
15 years 12 months ago
2005
Springer
We present two polynomial-time approximation algorithms for the metric case of the maximum traveling salesman problem. One of them is for directed graphs and its approximation rat...
182
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,...
194
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 ...
163
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...