Low-degree graph partitioning via local search with applications to constraint satisfaction, max cut, and coloring

Journal of Graph Algorithms and Applications

Volumn 1, Issue , 1997, Pages 1-13

  Halldórsson, Magnús M ^a   Lau, Hoong Chuin ^b  

^a UNIVERSITY OF ICELAND   (Iceland)

^b INSTITUTE FOR INFOCOMM RESEARCH   (Singapore)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0002552419     PISSN: 15261719     EISSN: None     Source Type: Journal    
DOI: 10.7155/jgaa.00003     Document Type: Article

References (23)

1. Paola Alimonti. New local search approximation techniques for maximum generalized satisfiability problems. Inf. Proc. Let., 57(3):151-158, 12 Feb 1996.
2. O. V. Borodin and A. V. Kostochka. On an upper bound of a graph's chromatic number, depending on the graph's degree and density. J. Combin. Theory Ser. B, 23:247-250, 1977.
3. P. A. Catlin. A bound on the chromatic number of a graph. Discrete Math., 22:81-83, 1978.
4. P. Crescenzi and V. Kann. A compendium of NP optimization problems. Dynamic on-line survey available at ftp.nada.kth.se, also in http://www.nada.kth.se/~viggo/problemlist/compendium.html, Oct. 1995.
5. Rina Dechter and Judea Pearl. Network-based heuristics for constraint satisfaction. Artif. Intell., 34:1-38, 1988.
6. Uriel Feige and Michel Goemans. Approximating the Value of Two-Prover Proof Systems, with Applications to MAX 2SAT and MAX DICUT. In Proc. Israel Symp. on Theoretical Computer Science, 182-189, 1995.
7. Alan Frieze and Mark Jerrum. Improved approximation algorithms for MAX k-CUT and MAX BISECTION. Algorithmica, 18(1):67-81, May 1997.
8. Michel X. Goemans and David P. Williamson. New 3/4 Approximation Algorithms for the Maximum Satisfiability Problem. SIAM J. Disc. Math, 7(4):656-666, 1994.
9. Michel X. Goemans and David P. Williamson. Improved Approximation Algorithms for Maximum Cut and Satisfiability Problems Using Semidefinite Programming. J. ACM, 42:1115-1145, 1995.
10. D. J. Haglin and S. M. Venkatesan. Approximation and intractability results for the maximum cut problem and its variants. IEEE Transactions on Computers, 40:110-113, 1991.
11. D. S. Hochbaum. Efficient bounds for the stable set, vertex cover, and set packing problems. Disc. Applied Math., 6:243-254, 1983.
12. Y. Kajitani, J. D. Cho, and M. Sarrafzadeh. New approximation results on graph matching and related problems. In Graph-Theoretic Concepts in Computer Science, International Workshop (WG), pages 343-358. Springer Verlag LNCS (903), 1994.
13. D. Karger, R. Motwani and M. Sudan. Approximate Graph Coloring by Semidefinite Programming. In Proc. 35th IEEE Symp. on Found. of Comp. Sci., pages 2-13, 1994.
14. S. Khanna, R. Motwani, M. Sudan, and U. Vazirani. On syntactic versus computational views of approximability. In Proc. 35th IEEE Symp. on Found. of Comp. Sci., pages 819-830, 1994.
15. H. C. Lau. Approximation of constraint satisfaction via local search. In Proc. 4th Wksp. on Algorithms and Data Structures (WADS), pages 461-472. Springer LNCS (955), 1995.
16. H. C. Lau and O. Watanabe. Randomized Approximations of the Constraint Satisfaction Problem. Nordic J. Computing, 3:405-424, 1996.
17. J. Lawrence. Covering the vertex set of a graph with subgraphs of smaller degree. Discrete Math., 21:61-68, 1978.
18. L. Lovász. On decomposition of graphs. Stud. Sci. Math. Hung., 1:237-238, 1966.
19. L. Lovász. Three short proofs in graph theory. J. Combin. Theory Ser. B, 19:269-271, 1975.
20. Svatopluk Poljak and Daniel Turzík. A polynomial time algorithm for constructing a large bipartite subgraph, with an application to a satisfiability problem. Can. J. Math, 34(3):519-524, 1982.
21. Luca Trevisan. Positive Linear Programming, Parallel Approximation and PCPs. In Proc. European Symp. on Algorithms (ESA). Springer LNCS (1136), 1996.
22. P. M. Vitányi. How well can a graph be n-colored. Discrete Math, 34:69-80, 1981.
23. M. Yannakakis. On the Approximation of Maximum Satisfiability. J. Algo, 17:475-502, 1994.