Non-metric multicommodity and multilevel facility location

Authors:
Rudolf Fleischer;Jian Li;Shijun Tian;Hong Zhu
Affiliations:
Department of Computer Science and Engineering, Shanghai Key Laboratory of Intelligent Information Processing, Fudan University, Shanghai, China;Department of Computer Science and Engineering, Shanghai Key Laboratory of Intelligent Information Processing, Fudan University, Shanghai, China;Department of Computer Science and Engineering, Shanghai Key Laboratory of Intelligent Information Processing, Fudan University, Shanghai, China;Department of Computer Science and Engineering, Shanghai Key Laboratory of Intelligent Information Processing, Fudan University, Shanghai, China
Venue:
AAIM'06 Proceedings of the Second international conference on Algorithmic Aspects in Information and Management
Year:
2006

Citing 9
Cited 0

Approximation algorithms for facility location problems (extended abstract)

STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
A threshold of ln n for approximating set cover

Journal of the ACM (JACM)
Improved methods for approximating node weighted Steiner trees and connected dominating sets

Information and Computation
Greedy strikes back: improved facility location algorithms

Journal of Algorithms
A 3-approximation algorithm for the k-level uncapacitated facility location problem

Information Processing Letters
Approximation algorithms for facility location problems

APPROX '00 Proceedings of the Third International Workshop on Approximation Algorithms for Combinatorial Optimization
Multicommodity facility location

SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Approximating the two-level facility location problem via a quasi-greedy approach

SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Facility location with Service Installation Costs

SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms

Quantified Score

Hi-index	0.00

Visualization

Abstract

We give logarithmic approximation algorithms for the non-metric uncapacitated multicommodity and multilevel facility location problems. The former algorithms are optimal up to a constant factor, the latter algorithm is far away from the lower bound, but it is the first algorithm to solve the general multilevel problem. To solve the multicommodity problem, we also define a new problem, the friendly tour operator problem, which we approximate by a greedy algorithm.