Non-uniform graph partitioning

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 2014, Pages 1229-1243

  Krauthgamer, Robert ^a   Naor, Joseph ^b   Schwartz, Roy ^c   Talwar, Kunal ^c  

^a WEIZMANN INSTITUTE OF SCIENCE   (Israel)

^b TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

^c MICROSOFT RESEARCH   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION ALGORITHMS; REGRESSION ANALYSIS;

BICRITERIA APPROXIMATION; CONCENTRATION BOUNDS; GRAPH PARTITIONING PROBLEMS; PARTITIONING PROBLEM; PARTITIONING TECHNIQUES; RANDOMIZED ROUNDING; RECURSIVE PARTITIONING; WEIGHTED UNDIRECTED GRAPH;

TREES (MATHEMATICS);

EID: 84902115089     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1137/1.9781611973402.91     Document Type: Conference Paper

References (36)

1. [AHKM11] M. Andrews, M. T. Hajiaghayi, H. Karloff, and A. Moitra. Capacitated metric labeling. In Proceedings of the Twenty-Second Annual ACM-S1AM Symposium on Discrete Algorithms, SODA '11, pages 976-995. SIAM, 2011.
2. [ALN08] S. Arora, J. R. Lee, and A. Naor. Euclidean distortion and the sparsest cut. J. Amer. Math. Soc., 21(1):1-21, 2008.
3. [AR98] Y. Aumann and Y. Rabani. An O(log k) approximate min- cut max-flow theorem and approximation algorithm. SIAM J. Comput., 27(1), 1998.
4. [AR06] K. Andreev and H. Racke. Balanced graph partitioning. Theor. Comp. Sys., 39(6):929-939, 2006.
5. [ARV08] S. Arora, S. Rao, and U. V. Vazirani. Geometry, flows, and graph-partitioning algorithms. Commun. ACM, 51(10):96-105, 2008.
6. [Bar82] R. Barnes. An algorithm for partitioning the nodes of a graph. SIAM. J. on Algebraic and Discrete Methods, 3(4):541-550, 1982.
7. [BFK+11] N. Bansal, U. Feige, R. Krauthgamer, K. Makarychev, V. Nagarajan, J. S. Naor, and R. Schwartz. Min-max graph partitioning and small set expansion. In 52nd Annual Symposium on Foundations of Computer Science, pages 17-26. IEEE Computer Society, 2011.
8. [BMC+12] P. Bodik, I. Menache, M. Chowdhury, P. Mani, D. A. Maltz, and I. Stoica. Surviving failures in bandwidth- constrained datacenters. In Proceedings of the ACM SIG- COMM 2012 conference on Applications, technologies, architectures, and protocols for computer communication, SIG- COMM '12, pages 431-442, New York, NY, USA, 2012. ACM.
9. [BVW88] E. R. Barnes, A. Vannelli, and J. Q. Walker. A new heuristic for partitioning the nodes of a graph. SIAM. J. Discrete Mathematics, 1(3):299-305, 1988.
10. [CGR08] S. Chawla, A. Gupta, and H. Racke. Embeddings of negative-type metrics and an improved approximation to generalized sparsest cut. ACM Transactions on Algorithms, 4(2), 2008.
11. σ(1) integrality gap for the sparsest cut SDP. In FOCS, pages 555- 564. IEEE Computer Society, 2009.
12. [CS11] D. Chakrabarty and C. Swamy. Facility location with client latencies: Linear programming based techniques for minimum latency problems. In 15th international conference on Integer programming and combinatoral optimization, IPCO'11, pages 92-103. Springer-Verlag, 2011. Full version as arXiv: 1009.2452.
13. [ENRS99] G. Even, J. Naor, S. Rao, and B. Schieber. Fast approximate graph partitioning algorithms. SIAM J. Comput., 28(6):2187-2214, 1999.
14. [ENRS00] G. Even, J. Naor, S. Rao, and B. Schieber. Divide-and- conquer approximation algorithms via spreading metrics. J. ACM, 47(4):585-616, 2000.
15. [FF12] A. E. Feldmann and L. Foschini. Balanced Partitions of Trees and Applications. In 29th International Symposium on Theoretical Aspects of Computer Science (STACS 2012), volume 14, pages 100-111, Dagstuhl, Germany, 2012. Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik.
16. [FK06] U. Feige and R. Krauthgamer. A polylogarithmic approximation of the minimum bisection. SIAM Review, 48(1):99- 130, 2006.
17. [Fre75] D. A. Freedman. On tail probabilities for martingales. Ann. Probability, 3:100-118, 1975.
18. [GVY93] N. Garg, V. V. Vazirani, and M. Yannakakis. Approximate max-flow min-(multi)cut theorems and their applications. SIAM Journal on Computing, 25:698-707, 1993.
19. [HMV92] S. Hadley, B. Mark, and A. Vannelli. An efficient eigenvector approach for finding netlist partitions. Computer-Aided Design of Integrated Circuits and Systems, IEEE Transactions on, 11(7), 1992.
20. [KLL+13] T. C. Kwok, L. C. Lau, Y. T. Lee, S. Oveis Gharan, and L. Trevisan. Improved cheeger's inequality: Analysis of spectral partitioning algorithms through higher order spectral gap. In 45th annual ACM symposium on Symposium on theory of computing, STOC '13, pages 11-20. ACM, 2013.
21. [KNS09] R. Krauthgamer, J. Naor, and R. Schwartz. Partitioning graphs into balanced components. In SODA, pages 942-949, 2009.
22. [LLR95] N. Linial, E. London, and Y. Rabinovich. The geometry of graphs and some of its algorithmic applications. Combinatorica, 15(2), 1995.
23. [LM13] A. Louis and K. Makarychev. Approximation algorithm for sparsest k-partitioning. CoRR, abs/1306.4384, 2013.
24. [LN06] J. R. Lee and A. Naor. Lp metrics on the Heisenberg group and the Goemans-Linial conjecture. In FOCS, pages 99-108. IEEE Computer Society, 2006.
25. [LOT 12] J. R. Lee, S. Oveis Gharan, and L. Trevisan. Multi-way spectral partitioning and higher-order cheeger inequalities. In 44th symposium on Theory of Computing, pages 1117-1130. ACM, 2012.
26. [LR99] T. Leighton and S. Rao. Multicommodity max-flow min- cut theorems and their use in designing approximation algorithms. J. ACM, 46(6):787-832, 1999.
27. [LRTV11] A. Louis, P. Raghavendra, P. Tetali, and S. Vempala. Algorithmic extensions of cheeger's inequality to higher eigenvalues and partitions. In 14th international workshop and 15th international conference on Approximation, randomization, and combinatorial optimization: Algorithms and techniques, APPROX' 11/RANDOM' 11, pages 315-326. Springer-Verlag, 2011.
28. [LRTV12] A. Louis, P. Raghavendra, P. Tetali, and S. Vempala. Many sparse cuts via higher eigenvalues. In 44th Symposium on Theory of Computing, pages 1131-1140. ACM, 2012.
29. [MMV12] K. Makarychev, Y. Makarychev, and A. Vijayaraghavan. Approximation algorithms for semi-random partitioning problems. In Proceedings of the 44th symposium on Theory of Computing, STOC '12, pages 367-384. ACM, 2012.
30. [R08] H. Racke. Optimal hierarchical decompositions for congestion minimization in networks. In Proceedings of the 40th annual ACM symposium on Theory of computing, STOC '08, pages 255-264, 2008.
31. [RS10] P. Raghavendra and D. Steurer. Graph expansion and the unique games conjecture. In STOC, pages 755-764, 2010.
32. [RST10] P. Raghavendra, D. Steurer, and P. Tetali. Approximations for the isoperimetric and spectral profile of graphs and related parameters. In STOC, pages 631-640, 2010.
33. [RST12] P. Raghavendra, D. Steurer, and M. Tulsiani. Reductions between expansion problems. In IEEE Conference on Computational Complexity, pages 64-73, 2012.
34. [RW95] F. Rendl and H. Wolkowicz. A projection technique for partitioning the nodes of a graph. Annals of Operations Research, 58(3): 155-179, 1995.
35. [San89] L. A. Sanchis. Multiple-way network partitioning. IEEE Trans. Comput., 38(1 ):62-81, January 1989.
36. [You01] N. Young. Sequential and parallel algorithms for mixed packing and covering. In Proceedings of the 42nd IEEE symposium on Foundations of Computer Science, FOCS '01, pages 538-, Washington, DC, USA, 2001. IEEE Computer Society.