Solving the Uncapacitated Facility Location Problem using message passing algorithms

Journal of Machine Learning Research

Volumn 9, Issue , 2010, Pages 429-436

  Lazic, Nevena ^a   Frey, Brendan J ^a   Aarabi, Parham ^a  

^a UNIVERSITY OF TORONTO   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

DISCRETE LOCATION; FACILITY LOCATION PROBLEM; FIXED POINTS; GRAPHICAL MODEL; MAX-PRODUCT; MAX-PRODUCT ALGORITHMS; MESSAGE PASSING ALGORITHM; PROBABILISTIC INFERENCE;

ARTIFICIAL INTELLIGENCE; SITE SELECTION;

APPROXIMATION ALGORITHMS;

EID: 84862279830     PISSN: 15324435     EISSN: 15337928     Source Type: Journal    
DOI: None     Document Type: Conference Paper

References (24)

1. Arora, S., Lund, C., Motwani, R., Sudan, M., & Szegedy, M. (1998). Proof verification and hardness of approximation problems. Journal of the ACM, 45.
2. Bendetto, S., Montorsi, G., Divsalar, D., & Pollara, F. (1996). Soft-output decoding algorithms in iterative decoding of turbo codes (Tech. Rep.). JPL TDA.
3. Byrka, J. (2007). An optimal bifactor approximation algorithm for the metric up. Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, 4627.
4. Chudak, F., & Shmoys, D. (2003). Improved approximation algorithms for the uncapacitated facility location problem. SIAM Journal on Computing, 33 (1).
5. Dueck, D., Frey, B., Jojic, N., & Jojic, V. (2008). Constructing treatment portfolios using affinity propagation. In International conference on research in computational molecular biology.
6. Frank, C., & Romer, K. (2007). Distributed facility location algorithms for flexible configuration of wireless sensor networks. In Distributed computing in sensor systems. Springer.
7. Frey, B., & Dueck, D. (2007). Clustering by passing messages between data points. Science.
8. Globerson, A., & Jaakkola, T. (2007). Fixing max-product: Convergent message passing algorithms for map lprelaxations. In Advances in neural information processing systems.
9. Guha, S., & Khuller, S. (1999). Greedy strikes back: Improved facility location algorithms. Journal of Algorithms, 31.
10. Hochbaum, D. S. (1982). Heuristics for the fixed cost median problem. Mathematical Programming, 22 (2).
11. Jain, K., Mahdian, M., & Saberi, A. (2002). A new greedy approach for facility location problems. In Proc. 34th annual acm symposium on theory of computing.
12. Jain, K., & Vazirani, V. (2001). Approximation algorithms for metric facility location and k-median problems using the primal-dual schema and lagrangian relaxation. Journal of the ACM, 48.
13. Klose, A., & Drexl, A. (2003). Facility location models for distribution system design. European Journal of Operations Research.
14. Kolmogorov, V. (2006). Convergent tree-reweighted message passing for energy minimization. IEEE Trans. on Pattern Analysis and Machine Intelligence, 28 (10), 1568-1583.
15. Komodakis, N., & Paragios, N. (2008). Beyond loose lprelaxations: optimizing mrfs by repairing cycles. In European conference on computer vision.
16. Kschischang, F., Frey, B., & Loeliger, H.-A. (2001). Factor graphs and the sum-product algorithm. IEEE Transactions on Information Theory, 47 (2).
17. Lazic, N., Givoni, I., Frey, B., & Aarabi, P. (2009). Floss: Facility location for subspace segmentation. In International conference on computer vision.
18. Li, H. (2007). Two-view motion segmentation from linear programming relaxation. In Computer vision and pattern recognition.
19. Mahdian, M., Ye, Y., & Zhang, J. (2007). Approximation algorithms for metric facility location problems. SIAM Journal on Computing, 36 (2).
20. Samaria, F., & Harter, A. (1994). Parameterization of a stochastic model for human face identification. In Proc. 2nd ieee workshop on applications of computer vision.
21. Shmoys, D., Tardos, E., & Aardal, K. (1997). Approximation algorithms for facility location problems. In Proc. 29th annual acm symposium on theory of computing.
22. Sontag, D., & Jaakkola, T. (2009). Tree block coordinate descent for map in graphical models. In 12th international workshop on artificial intelligence and statistics.
23. Sviridenko, M. (2002). An improved approximation algorithm for the metric up. In Proc. 9th conf. on integer programming and combinatorial optimization.
24. Werner, T. (2007). A linear programming approach to the max-sum problem: a review. IEEE Trans. on Pattern Analysis and Machine Intelligence, 29 (7).