667 search results - page 12 / 134 » Approximation algorithms for connected facility location pro... |
152
Voted
IPCO
2004
15 years 4 months ago
2004
Abstract. We study two-stage, finite-scenario stochastic versions of several combinatorial optimization problems, and provide nearly tight approximation algorithms for them. Our pr...
107
click to vote
AI
2009
Springer
15 years 9 months ago
2009
Springer
Abstract. This paper solves a static and transportation facility location allocation problem defined as follows: given a set of locations Loc and a set of demand objects D located ...
127
Voted
SODA
2010
ACM
15 years 12 months ago
2010
ACM
Consider the following problem: given a metric space, some of whose points are "clients," select a set of at most k facility locations to minimize the average distance f...
145
click to vote
COCOON
2004
Springer
15 years 6 months ago
2004
Springer
In this work, we study an extension of the k-center facility location problem, where centers are required to service a minimum of clients. This problem is motivated by requirement...
119
click to vote
FOCS
2000
IEEE
15 years 7 months ago
2000
IEEE
In this paper, we give the first constant-approximations for a number of layered network design problems. We begin by modeling hierarchical caching, where caches are placed in la...