Cut size statistics of graph bisection heuristics

SIAM Journal on Optimization

Volumn 10, Issue 1, 1999, Pages 231-251

  Schreiber, G R ^a,b   Martin, O C ^a  

^a UNIVERSITÉ PARIS SACLAY   (France)

^b CEA SACLAY   (France)

Author keywords

Graph partitioning; Heuristics; Ranking; Self averaging

Indexed keywords

EID: 0033269654     PISSN: 10526234     EISSN: None     Source Type: Journal    
DOI: 10.1137/S1052623497321523     Document Type: Article

References (29)

1. X. AZUMA, Weighted sums of certain dependent random variables, Tôhoku Math. J., 19 (1967), pp. 357-367.
2. J. R. BANAVAR, D. SHERRINGTON, AND N. SOURLAS, Graph bipartitioning and statistical mechanics, J. Phys. A, 20 (1987), pp. L1-L8.
3. M. BERGER AND S. BOKHARI, A partitioning strategy for non-uniform problems on multiprocessors, IEEE Trans. Comput., C-36 (1987), p. 570-580.
4. J. W. BERRY AND M. K. GOLDBERG, Path optimization for graph partitioning problems, Discrete Appl. Math., 90 (1999), pp. 27-50.
5. C. DE DOMINICIS AND Y. GOLDSCHMIDT, Replica symmetry breaking in finite connectivity systems: A large connectivity expansion at finite and zero temperature, J. Phys. A, 22 (1989), pp. L775-L781.
6. A. DUNLOP AND B. KERNIGHAN, A procedure for placement of standard-cell VLSI circuits, IEEE Trans. Computer-Aided Design, CAD-4, 1 (1985), p. 92-98.
7. C. FlDUCClA AND R. MATTHEYSES, A linear-time heuristic for improving network partitions, in Proc. 19th Design Automation Workshop, Las Vegas, IEEE, 1982, p. 175-181.
8. Y. Fu AND P. ANDERSON, Application of statistical mechanics to NP-complete problems in combinatorial optimization, J. Phys. A, 19 (1986), p. 1605-1620.
9. M. R. GAREY AND D. S. JOHNSON, Computers and Intractability: A Guide to the Theory of NP-Completeness, W. H. Freeman, New York, 1979.
10. B. HENDRICKSON AND R. LELAND, The Chaco user's guide: Version 2.0, Tech. Report SAND94-2692, Sandia National Labs., Albuquerque, NM, June 1995.
11. B. HENDRICKSON AND R. LELAND, A multilevel algorithm for partitioning graphs, in Proc. Supercomputing '95, ACM, New York, 1995.
12. F. JOHANNES, Partitioning of VLSI circuits and systems, in Proc. 33rd Design Automation Conference, Las Vegas, NV, June 1996.
13. D. JOHNSON, C. ARAGON, L. MCGEOCH, AND C. SCHEVON, Optimization by simulated annealing: An experimental evaluation, Part I (graph partitioning), Oper. Res., 37 (1989), pp. 865-892.
14. D. JOHNSON AND L. MCGEOCH, The traveling salesman problem: A case study in local optimization, in Local Search in Combinatorial Optimization, E. Aarts and J. Lenstra, eds., John Wiley, New York, 1996.
15. G. KARYPIS AND V. KUMAR, A fast and high quality multilevel scheme for partitioning irregular graphs, SIAM J. Sci. Comput., 20 (1999), pp. 359-392.
16. S. KAUFFMAN AND S. LEVIN, Towards a general theory of adaptive walks on rugged landscapes, J. Theoret. Biol., 128 (1987), pp. 11-45.
17. B. KERNIGHAN, Some Graph Partitioning Problems Related to Program Segmentation, Ph.D. Thesis, Princeton University, Princeton, NJ, 1969.
18. B. KERNIGHAN AND S. LIN, An efficient heuristic procedure for partitioning graphs, Bell System Tech. J., 49 (1970), pp. 291-307.
19. S. KIRKPATRICK, C. GELATT, AND M. VECCHI, Optimization by simulated annealing, Science, 220 (1983), pp. 671-680.
20. K. LANG AND S. RAO, Finding near-optimal cuts: An empirical evaluation, in Proc. Fourth Annual ACM-SlAM Symposium on Discrete Algorithms, SIAM, Philadephia, 1993.
21. R. LELAND AND B. HENDRICKSON, An empirical study of static load balancing algorithms, in Scalable High Performance Computing Conference, IEEE Computer Society Press, Los Alamitos, CA, 1994, pp. 682-685.
22. S. LIN, Computer solutions of the traveling salesman problem, Bell System Tech. J., 44 (1905), pp. 2245-2269.
23. O. MARTIN, S. W. OTTO, AND E. W. FELTEN. Large-step Markov chains for the TSP incorporating local search heuristics, Oper. Res. Lett., 11 (1092), pp. 219-224.
24. O. C. MARTIN AND S. W. OTTO, Partitioning of unstructured meshes for load balancing, Concurrency: Practice and Experience, 7 (1995), pp. 303-314.
25. O. C. MARTIN AND S. W. OTTO, Combining simulated annealing with local search heuristics, Ann. Oper. Res., 63 (1996), pp. 57-75.
26. M. MEZARD, G. PARISI, AND M. A. VIRASORO, EDS., Spin Glass Theory and Beyond, World Sci. Lecture Notes Phys. 9, World Scientific, Singapore, 1987.
27. C. H. PAPADIMITRIOU AND K. STEIGLITZ, Combinatorial Optimization: Algorithms and Complexity, Prentice-Hall, Englewood Cliffs, NJ, 1982.
28. P. J. M. VAN LAARHOVEN AND E. H. L. AARTS, Statistical cooling: A general approach to combinatorial optimization problems, Philips J. Res., 40 (1985), pp. 193-226.
29. P. J. M. VAN LAARHOVEN AND E. H. L. AARTS, Simulated Annealing: Theory and Applications, Mathematics and Its Applications, D. Reidel, Dordrecht, the Netherlands, 1987, pp. 39-98.