Submodular cost allocation problem and applications

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 6755 LNCS, Issue PART 1, 2011, Pages 354-366

  Chekuri, Chandra ^a   Ene, Alina ^a  

^a Digital Computer Laboratory   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALLOCATION PROBLEMS; COST ALLOCATION PROBLEM; FACILITY LOCATION PROBLEM; HYPERGRAPH; IS APPROXIMATION; METRIC LABELING; MULTIWAY CUT PROBLEMS; MULTIWAY PARTITION PROBLEM; ROUNDING PROCEDURES; SET FUNCTION; SUBMODULAR; SUBMODULAR FUNCTIONS;

DEPRECIATION; LOCATION;

APPROXIMATION ALGORITHMS;

EID: 79959998988     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-22006-7_30     Document Type: Conference Paper

References (26)

1. Calinescu, G., Chekuri, C., Pál, M., Vondrák, J.: Maximizing a submodular set function subject to a matroid constraint (Extended abstract). In: Fischetti, M., Williamson, D.P. (eds.) IPCO 2007. LNCS, vol. 4513, pp. 182-196. Springer, Heidelberg (2007)
2. Calinescu, G., Karloff, H.J., Rabani, Y.: An improved approximation algorithm for multiway cut. Journal of Computer and System Sciences 60(3), 564-574 (2000), Preliminary version in STOC 1998
3. Chekuri, C., Ene, A.: Approximation algorithms for submodular multiway partition (April 2011) (manuscript)
4. Dahlhaus, E., Johnson, D.S., Papadimitriou, C.H., Seymour, P.D., Yannakakis, M.: The complexity of multiterminal cuts. SIAM Journal on Computing 23(4), 864-894 (1994), Preliminary version in STOC 1992
5. Delong, A., Osokin, A., Isack, H.N., Boykov, Y.: Fast approximate energy minimization with label costs. In: IEEE Computer Vision and Pattern Recognition (CVPR), pp. 2173-2180 (2010)
6. Freund, A., Karloff, H.J.: A lower bound of 8/(7+(1/k)-1) on the integrality ratio of the calinescu-karloff-rabani relaxation for multiway cut. Information Processing Letters 75(1-2), 43-50 (2000)
7. Fukunaga, T.: Computing Minimum Multiway Cuts in Hypergraphs from Hypertree Packings. In: Eisenbrand, F., Shepherd, F.B. (eds.) IPCO 2010. LNCS, vol. 6080, pp. 15-28. Springer, Heidelberg (2010)
8. Garg, N., Vazirani, V.V., Yannakakis, M.: Multiway cuts in node weighted graphs. Journal of Algorithms 50(1), 49-61 (2004), Preliminary version in ICALP 1994
9. Ge, D., Ye, Y., Zhang, J.: The Fixed-Hub Single Allocation Problem: A Geometric Rounding Approach (2007), preprint http://www.stanford.edu/~yyye/ revisedHub.pdf
10. Goel, G., Karande, C., Tripathi, P., Wang, L.: Approximability of combinatorial problems with multi-agent submodular cost functions. In: IEEE Symposium on Foundations of Computer Science (FOCS), pp. 755-764 (2009)
11. Goemans, M.X., Harvey, N.J.A., Iwata, S., Mirrokni, V.S.: Approximating submodular functions everywhere. In: ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 535-544 (2009)
12. Iwata, S., Nagano, K.: Submodular function minimization under covering constraints. In: IEEE Symposium on Foundations of Computer Science (FOCS), pp. 671-680 (2009)
13. Karger, D.R., Klein, P.N., Stein, C., Thorup, M., Young, N.E.: Rounding algorithms for a geometric embedding of minimum multiway cut. Mathematics of Operations Research 29(3), 436-461 (2004), Preliminary version in STOC 1999
14. Kleinberg, J.M., Tardos, É.: Approximation algorithms for classification problems with pairwise relationships: Metric labeling and Markov random fields. Journal of the ACM (JACM) 49(5), 616-639 (2002), Preliminary version in FOCS 1999
15. Lawler, E.L.: Cutsets and partitions of hypergraphs. Networks 3(3), 275-285 (1973)
16. Lovász, L.: Submodular functions and convexity. In: Mathematical Programming: The State of the Art, pp. 235-257 (1983)
17. Okumoto, K., Fukunaga, T., Nagamochi, H.: Divide-and-conquer algorithms for partitioning hypergraphs and submodular systems. Algorithmica, 1-20 (2010), Preliminary version in ISAAC 2009
18. Queyranne, M.: Minimizing symmetric submodular functions. Mathematical Programming 82(1), 3-12 (1998), Preliminary version in SODA 1995
19. Svitkina, Z., Fleischer, L.: Submodular approximation: Sampling-based algorithms and lower bounds. In: IEEE Symposium on Foundations of Computer Science (FOCS), pp. 697-706 (2008)
20. Svitkina, Z., Tardos, É.: Min-max multiway cut. In: Jansen, K., Khanna, S., Rolim, J.D.P., Ron, D. (eds.) RANDOM 2004 and APPROX 2004. LNCS, vol. 3122, pp. 207-218. Springer, Heidelberg (2004)
21. Svitkina, Z., Tardos, É.: Facility location with hierarchical facility costs. ACM Transactions on Algorithms (TALG) 6(2), 1-22 (2010), Preliminary version in SODA 2006
22. Vondrák, J.: Optimal approximation for the submodular welfare problem in the value oracle model. In: ACM Symposium on Theory of Computing (STOC), pp. 67-74 (2008)
23. Vondrák, J.: Symmetry and Approximability of Submodular Maximization Problems. In: IEEE Symposium on Foundations of Computer Science (FOCS), pp. 651-670 (2010)
24. Williamson, D.P., Shmoys, D.B.: The design of approximation algorithms (2010), preprint http://www.designofapproxalgs.com
25. Xiao, M.: Finding minimum 3-way cuts in hypergraphs. Information Processing Letters 110(14-15), 554-558 (2010), Preliminary version in TAMC 2008
26. Zhao, L., Nagamochi, H., Ibaraki, T.: Greedy splitting algorithms for approximating multiway partition problems. Mathematical Programming 102(1), 167-183 (2005)