Design and Performance of Parallel and Distributed Approximation Algorithms for Maxcut

Journal of Parallel and Distributed Computing

Volumn 46, Issue 1, 1997, Pages 48-61

  Homer, Steven ^a   Peinado, Marcus ^b  

^a BOSTON UNIVERSITY   (United States)

^b FRAUNHOFER INSTITUTE FOR APPLIED INFORMATION TECHNOLOGY FIT   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0001870308     PISSN: 07437315     EISSN: None     Source Type: Journal    
DOI: 10.1006/jpdc.1997.1381     Document Type: Article

References (40)

1. A. Alexandrov, M. F. Ionescu, K. E. Schauser, C. Scheiman, 1995, LogGP: Incorporating long messages into the LogP model, Proc. 7th ACM Symposium on Parallel Algorithms and Architectures, 95, 105.
2. F. Alizadeh, Interior point methods in semidefinite programming with applications to combinatorial optimization, SIAM J. Optimization.
3. Alon N., Kahale N. Approximating the independence number via the θ-function. Manuscript. Aug. 1994.
4. Anderson E., Bai Z., Bischof C., Demmel J., Dongarra J., Croz J. D., Greenbaum A., Hammarling S., McKenney A., Ostrouchov S., Sorensen D. LAPACK Users' Guide. 1992;SIAM.
5. A. Bar-Noy, S. Kipnis, 1992, Designing broadcasting algorithms in the postal model for message passing systems, Proc. of SPAA, 13, 22.
6. Barahona F., Grötschel M., Jünger M., Reinelt G. An application of combinatorial optimization to statistical optimization and circuit layout design. Oper. Res. 36:1988;493-513.
7. J. Berry, M. Goldberg, Path optimization and near-greedy analysis for graph partitioning: An empirical study, Manuscript.
8. Chang K. C., Du D. H. Efficient algorithms for layer assignment problems. IEEE Trans. Computer-Aided Design. 6:1987;67-78.
9. Chen R., Kajitani Y., Chan S. A graph-theoretic via minimization algorithm for two-layer printed circuit boards. IEEE Trans. Circuits Systems. 30:1983;284-299.
10. B. Chor, M. Sudan, Sept. 1995, A geometric approach to betweenness, Proceedings of the Third Annual European Symposium on Algorithms, 227, 237, Corfu, Greece.
11. D. Culler, R. Karp, D. Patterson, A. Sahay, K. Schauser, E. Santos, R. Subramonian, T. von Eicken, 1993, LogP: Towards a realistic model of parallel computation, Proceedings of the fourth ACM SIGPLAN Symposium on Principles & Practice of Parallel Programming, 1, 12.
12. Delorme C., Poljak S. The performance of an eigenvalue bound on the max-cut problem in some classes of graphs. Discrete Math. 111:1993;145-156.
13. U. Feige, M. Goemans, 1995, Approximating the value of two prover proof systems, with applications to MAX 2SAT and MAX DICUT, Proceedings of the Third Isreal Symposium on Theory and Computing Systems.
14. Int. J. Supercomput. Appl. 8:1994.
15. Frieze A., Jerrum M. Improved approximation algorithms for MAX-k. Algorithmica. 1996.
16. Goemans M. X., Williamson D. P. Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming. J. Assoc. Comput. Mach. 42:Nov. 1995;1115-1145.
17. Gruber P. M., Wills J. M. Mathematical programming and convex geometry. Convex Geometry. 1993;North-Holland, Amsterdam.
18. Johnson D. S., Aragon C. R., McGeoch L. A., Schevon C. Optimization by simulated annealing: An experimental evaluation; Part I, graph partitioning. Oper. Res. 37:1989;865-892.
19. Johnsson S. L. Communication efficient basic linear algebra computations on hypercube architectures. J. Parallel Distrib. Comput. 4:1987;133-172.
20. D. Karger, R. Motwani, M. Sudan, 1994, Approximate graph coloring by semidefinite programming, Proceedings 35th IEEE Symposium on the Foundations of Computer Science, 2, 13.
21. Karmarkar N. A new polynomial-time algorithm for linear programming. Combinatorica. 4:1984;373-395.
22. Karp R., Sahay A., Santos E. Optimal broadcast and summation in the LogP model. Technical Report. CSD-92-721:1992.
23. Karp R. M. Reducibility among combinatorial problems. Complexity of Computer Computations. 1972;Plenum Press, New York. p. 85-103.
24. P. Klein, H.-I. Lu, 1996, Efficient approximation algorithms for semidefinite programs arising from maxcut and coloring, Proc. 28th ACM Symposium on the Theory of Computing, 338, 347.
25. Kowalik J., Osborne M. R. Methods for Unconstrained Optimization Problems. 1968;Elsevier, Amsterdam.
26. Murray W. Numerical Methods for Unconstrained Optimization. 1972;Academic Press, New York.
27. Nesterov Y., Nemirovskii A. Interior-Point Polynomial Algorithms in Convex Programming. 1994;SIAM.
28. Pinter R. Y. Optimal layer assignment for interconnect. J. VLSI Comput. Systems. 1:1984;123-137.
29. Polak E. Computational Methods in Optimization. 1971;Academic Press, New York.
30. Poljak S., Rendl F. Solving the max-cut problem using eigenvalues. Technical Report. 91735-OR:1991.
31. Poljak S., Rendl F. Nonpolyhedral relaxations of graph-bisection problems. Technical Report. 92-55:1992.
32. Press W. H., Flannery B. P., Teukolsky S. A., Vetterling W. T. Numerical Recipes in Fortran. 1992;Cambridge Univ. Press, Cambridge.
33. Rendl F., Vanderbei R., Wolkowicz H. Interior point methods for max-min eigenvalue problems. Technical Report. 264:1993.
34. Rosenlicht M. Introduction to Analysis. 1968;Scott, Foresman, Glenview.
35. Royden H. L. Real Analysis. 1968;Macmillan, New York.
36. Sahni S., Gonzalez T. P-complete approximation problems. J. Assoc. Comput. Mach. 23:1976;555-565.
37. Thinking Machines Corporation, Nov. 1993, Connection Machine CM5 Technical Summary.
38. Thinking Machines Corporation, Apr. 1994, CMSSL for CM Fortran, 3.2.
39. D. P. Williamson.
40. 3L. Math. Program. 50:1991;239-258.