Approximate hypergraph partitioning and applications

Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS

Volumn , Issue , 2007, Pages 579-589

  Fischer, Eldar ^a   Matsliah, Arie ^a   Shapira, Asaf ^b  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

^b MICROSOFT RESEARCH   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

AXIAL FLOW; BOOLEAN FUNCTIONS; COMPUTER SCIENCE; FIBER OPTIC CHEMICAL SENSORS; FOUNDATIONS; GRAPH THEORY; PARTITIONS (BUILDING);

GRAPH PARTITIONING; HYPERGRAPH PARTITIONING; HYPERGRAPHS; PARTITIONING ALGORITHMS; PROPERTY TESTER; R-UNIFORM HYPERGRAPHS; RANDOMIZED ALGORITHMS; REGULARITY LEMMA;

ALGORITHMS;

EID: 46749091287     PISSN: 02725428     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/FOCS.2007.4389527     Document Type: Conference Paper

References (30)

1. N. Alon, W. F. de la Vega, R. Kannan and M. Karpinski, Random sampling and approximation of MAX-CSP problems, Proc. of the 34 ACM STOC, ACM Press (2002), 232-239.
2. Also: JCSS 67 (2003), 212-243.
3. N. Alon, R. A. Duke, H. Lefmann, V. Rödl and R. Yuster, The algorithmic aspects of the regularity lemma, J. of Algorithms 16 (1994), 80-109.
4. N. Alon and A. Naor, Approximating the cut-norm via Grothendieck's inequality, SIAM J. on Computing 35 (2006), 787-803.
5. N. Alon and J. H. Spencer, The Probabilistic Method, Second Edition, Wiley, New York, 2000.
6. S. Arora, D. R. Karger and M. Karpinski, Polynomial time approximation schemes for dense instances of NP-Hard problems, J. Comput. Syst. Sci. 58 (1999), 193-210.
7. F.R.K. Chung, Regularity lemmas for hypergraphs and quasi-randomness, Random Structures and Algorithms, 2 (1991), 241-252.
8. A. Czumaj and C. Sohler, Testing hypergraph colorability, Theon Comput. Sci. 331 (2005), 37-52.
9. A. Czygrinow and V. Rödl, An algorithmic regularity lemma for hypergraphs, SIAM Journal on Computing, 30 (2000), 1041-1066.
10. R. Diestel, Graph Theory, Third Edition, Springer-Verlag, 2005.
11. R. Duke, H. Lefman and V. Rödl, A fast approximation algorithm for computing the frequencies of subgraphs in a given graph, SIAM J. on Computing 24 (1995) 598-620.
12. W. Fernandez de la Vega, Max-Cut has a randomized approximation scheme in dense graphs, Random Struct. Algorithms 8 (1996), 187-198.
13. E. Fischer and I. Newman, Testing versus estimation of graph properties, Proc. of STOC 2005, 138-146.
14. Also, SICOMP, to appear.
15. A. Frieze and R. Kannan, Quick approximation to matrices and applications, Combinatorica 19 (1999), 175-220.
16. A. Frieze and R. Kannan, A simple algorithm for constructing Szemerédi's regularity partition, Electr. J. Comb. 6: (1999).
17. A. Frieze and R. Kannan, The regularity lemma and approximation schemes for dense problems, Proc. of FOCS 1996, 12-20.
18. O. Goldreich, S. Goldwasser and D. Ron, Property testing and its connection to learning and approximation, JACM 45(4): 653-750 (1998).
19. T. Gowers, Lower bounds of tower type for Szemerédi's uniformity lemma, GAFA 7 (1997), 322-337.
20. T. Gowers, Hypergraph regularity and the multidimensional Szemerédi theorem, manuscript, 2006.
21. P. Haxell, B. Nagle and V. Rödl, An algorithmic version of the hypergraph regularity method, Proc of FOCS 2005, 439-448.
22. Y. Kohayakawa, V. Rödl and J. Skokan, Hypergraphs, quasi-randomness, and conditions for regularity, J. of Combinatorial Theory A, 97 (2002), 307-352.
23. Y. Kohayakawa, V. Rödl and L. Thoma, An optimal algorithm for checking regularity, SIAM J. on Computing 32 (2003), no. 5, 1210-1235.
24. J. Komlós and M. Simonovits, Szemerédi's regularity lemma and its applications in graph theory. In: Combinatorics, Paul Erdos is Eighty, Vol II (D. Miklós, V. T. Sós, T. Szönyi eds.), János Bolyai Math. Soc., Budapest (1996), 295-352.
25. M. Langberg, Testing the independence number of hypergraphs, Proc. of RANDOM 2004, 405-416.
26. B. Nagle, V. Rödl and M. Schacht, The counting lemma for regular k-uniform hypergraphs, Random Structures and Algorithms 28 (2006), 113-179.
27. V. Rödl and J. Skokan, Regularity lemma for k-uniform hypergraphs, Random Structures and Algorithms 25 (2004), 1-42.
28. E. Szemerédi, Integer sets containing no k elements in arithmetic progression, Acta Arith. 27 (1975), 299-345.
29. E. Szemerédi, Regular partitions of graphs, In: Proc. Colloque Inter. CNRS (J. C. Bermond, J. C. Fournier, M. Las Vergnas and D. Sotteau, eds.), 1978, 399-401.
30. T. Tao, A variant of the hypergraph removal lemma, J. Combin. Theory, Ser. A 113 (2006), 1257-1280.