Non-metric Multicommodity and Multilevel Facility Location

Abstract. We give logarithmic approximation algorithms for the nonmetric 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.

• Type: Conference
• Year: 2006
• Where: AAIM
• Authors: Rudolf Fleischer, Jian Li, Shijun Tian, Hong Zhu
• Keywords: AAIM 2006, Algorithms, General Multilevel Problem, Logarithmic Approximation Algorithms, Nonmetric Uncapacitated Multicommodity