Path optimization for graph partitioning problems

Discrete Applied Mathematics

Volumn 90, Issue 1-3, 1999, Pages 27-50

  Berry, Jonathan W ^a   Goldberg, Mark K ^b  

^a ELON UNIVERSITY   (United States)

^b Rensselaer Polytechnic Institute   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0002067484     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0166-218X(98)00084-5     Document Type: Article

References (37)

1. J.W. Berry, Path optimization for graph partitioning problems: a case study of near greedy analysis, Ph.D. Thesis, Rensselaer Polytechnic Institute, Dec 1994.
2. R.B. Boppana, Eigenvalues and graph bisection: an Average Case, in: Proceedings of the 28th Symposium on the Foundations of Computer Science, 1987, 280-285.
3. B.L. Bowerman, R.T. O'Connell, D.A. Dickey, Linear Statistical Models: An Applied Approach, Duxbury Press, Boston, Massachussetts 1986.
4. T.N. Bui, Graph bisection algorithms, Ph.D. thesis, Massachussetts Institute of Technology, 1986.
5. M. Burstein, S.J. Hong, R. Pelavin, Hierarchical VLSI layout: Simultaneous placement and wiring of gate arrays, in: Proceedings IFIP VLSI-83, August, 1983.
6. B.N. Clark, C.J. Colboum, D.S. Johnson, Unit disk graphs, Discrete Math., 86, (1990) 165-177.
7. L.H. Clark, F. Shahrokhi, L.A. Szekely, A linear time algorithm for graph partition problems, Technical Report, University of New Mexico, Department of Mathematics and Statistics, 1991.
8. W.E. Donath, A.J. Hoffman, Lower bounds for the partitioning of graphs, IBM J. Res. Dev. 17 (1973) 420-425.
9. A.E. Dunlop, Automatic layout of gate arrays, in: Proceedings ISCAS-83, May 1983, pp. 1245-1248.
10. CM. Fiduccia, R. M. Mattheyses, A linear-time heuristic for improving network partitions, in: Proceedings of the 19th IEEE Design Automation Conference, 1982, pp. 175-181.
11. M. Goemans, D. Williamson, 0.878-approximalion algorithms for max cut and max 2sat, in: Proceedings of the 26th ACM Symposium on Theory of Computing, 1994.
12. M. Goemans, D. Williamson, Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming, J. ACM, submitted.
13. M.K. Goldberg and M. Burstein, Heuristic improvement technique for bisection of VLSI networks, in: Proceedings of the IEEE International Conference on Computer Design: VLSI in Computers (ICCD '83) (1983) 122-125.
14. M.K. Goldberg and R. Gardner, On the minimal cut problem, in: Progress in Graph Theory, Academic Press, New York, 1984, 295-305.
15. M.K. Goldberg, S. Lath, J.W. Roberts, Heuristics for the graph bisection problem, Techinical Report 86-8, Rensselaer Polytechnic Institute, Department of Computer Science, 1986.
16. F.O. Hadlock, Finding a maximum cut of a planar graph in polynomial time, SIAM J. Comput. 4 (1975) 221-225.
17. B. Hendrickson, R. Leland, An improved spectral graph partitioning algorithm for mapping parallel computations, Technical Report SAND92-1460, Sandia National Laboratories, 1992.
18. B. Hendrickson, R. Leland, The Chaco Users Guide, version 1.0, Technical Report SAND93-2339, Sandia National Laboratories, 1993.
19. B. Hendrickson, R. Leland, A multilevel algorithm for partitioning graphs, Technical Report SAND93-1301, Sandia National Laboratories, 1993.
20. J. H. Holland, Adaptation in Natural and Artificial Systems, University of Michigan Press, Ann Arbor, 1975.
21. S. Homer, M. Peinado, A highly parallel algorithm to approximate maxcut on distributed memory architechtures, in: International Parallel Programming Symposium, 1995.
22. D.S. Johnson, C.R. Aragon, L.A. McGeoch, C. Schevon, Optimization by simulated annealing: An experimental evaluation, Part II (graph coloring and number partitioning), Oper. Res., to appear.
23. D.S. Johnson, C.R. Aragon, L.A. McGeoch, C. Schevon, Optimization by simulated annealing; part I, graph partitioning. Oper. Res., 37, (1989) 865-892.
24. B.W. Kernighan, S. Lin, An efficient heuristic procedure for partitioning graphs, Bell System Tech. J. 49 (1970) 291-307.
25. S. Kirkpatrick, C.D. Gelatt, M.P. Vecchi, Optimization by simulated annealing, Science, 220 (1983) 671-680.
26. P. Klein, S. Plotkin, C. Stein, E. Tardos, Faster approximations algorithms for the unit capacity concurrent flow problem with applications to routing and finding sparse cuts, in: Proceedings of the 22nd Annual Symposium on Theory of Computing, 1984, pp. 310-321.
27. K. Lang, S. Rao, Finding near-optimal cuts: an empirical evaluation, in: Proceedings of the Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, January 1993.
28. F.T. Leighton, Satish Rao, An approximate max-flow min-cut theorem for uniform multicommodity flow problems with applications to approximation algorithms, in: Proceedings of the 29th IEEE Symposium on the Foundations of Computer Science, 1988, pp. 422-431.
29. st Annual IEEE Symposium on the Foundations of Computer Science, 1980, pp. 270-281.
30. G.I. Orlova, Y.G. Dorfman, Finding the maximal cut in a graph, Engrg. Cybernet. 1972, pp. 502-504.
31. S. Poljak, F. Rendl, Solving the max-cut problem using eigenvalues. Technical Report 199, Technische Universitat Graz, Institute fur Mathematik, 1991.
32. S. Poljak, Z. Tuza, The max-cut problem - a survey, in: L. Lovasz, P. Seymour (eds.), Special Year on Combinatorial Optimization, DIMACS series in Discrete Mathematics and Theoretical Computer Science, 1993, to be published.
33. F. Rendl, H. Wolkowicz, A projection technique for partitioning the nodes for a Graph. Report 169, Technische Universitat Graz, Institute fur Mathematik, 1990.
34. F. Shahrokhi, D.W. Matula, The maximum concurrent flow problem and sparsest cuts, Southern Methodist University, March 1986.
35. F. Shahrokhi, D.W. Matula, The maximum concurrent flow problem, J. ACM, 37 (1990) 318-334.
36. J. Ullman, Computational aspects of VLSI, Computer Science Press, Rockville, MD 1984.
37. Y.C. Wei, C.K. Cheng, Towards an efficient hierarchical designs by ratio cut partitioning, in: Proceedings of the IEEE International Conference on Computer-aided Design, 1989, pp. 298-301.