The k-level facility location game

Authors:
Dachuan Xu;Donglei Du
Affiliations:
College of Applied Sciences, Beijing University of Technology, 100 Pingleyuan, Chaoyang District, Beijing 100022, PR China;Faculty of Administration, University of New Brunswick, Canada
Venue:
Operations Research Letters
Year:
2006

Citing 10
Cited 5

Approximation algorithms for facility location problems (extended abstract)

STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
A 3-approximation algorithm for the k-level uncapacitated facility location problem

Information Processing Letters
Approximation algorithms for metric facility location and k-Median problems using the primal-dual schema and Lagrangian relaxation

Journal of the ACM (JACM)
Improved Approximation Algorithms for Metric Facility Location Problems

APPROX '02 Proceedings of the 5th International Workshop on Approximation Algorithms for Combinatorial Optimization
A Simple Dual Ascent Algorithm for the Multilevel Facility Location Problem

APPROX '01/RANDOM '01 Proceedings of the 4th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems and 5th International Workshop on Randomization and Approximation Techniques in Computer Science: Approximation, Randomization and Combinatorial Optimization
The online median problem

FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
Group Strategyproof Mechanisms via Primal-Dual Algorithms

FOCS '03 Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science
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
Boosted sampling: approximation algorithms for stochastic optimization

STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Limitations of cross-monotonic cost sharing schemes

SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms

A Cost-Sharing Method for the Soft-Capacitated Economic Lot-Sizing Game

COCOA '09 Proceedings of the 3rd International Conference on Combinatorial Optimization and Applications
An approximation algorithm for the k-level capacitated facility location problem

Journal of Combinatorial Optimization
A cost-sharing method for an economic lot-sizing game

Operations Research Letters
Approximation algorithm for facility location with service installation costs

Operations Research Letters
A cross-monotonic cost-sharing scheme for the concave facility location game

Journal of Global Optimization

Quantified Score

Hi-index	0.00

Visualization

Abstract

We propose a cost-sharing scheme for the k-level facility location game that is cross-monotonic, competitive, and 6-approximate cost recovery. This extends the recent result for the 1-level facility location game of Pal and Tardos.