Simulated annealing for graph bisection (1993)

View PDF

Download Links

by Mark Jerrum
Venue:in Proceedings of the 34th Annual IEEE Symposium on Foundations of Computer Science
Citations:33 - 1 self

Documents Related by Co-Citation

11502 Computers and Intractability, A Guide to the Theory of NPCompleteness – M R Garey, D S Johnson - 1979
533 Optimization by simulated annealing: An experimental evaluation (part i), preliminary draft – D S Johnson, C R Aragon, L A McGeoch, C Schevon - 1987
1711 An Introduction to Probability Theory – W FELLER - 1968
682 Ant Colony Optimization – M Dorigo, T Stützle - 2004
2168 An Introduction to Probability Theory and Its Applications – W Feller - 1971
1573 PROBABILITY INEQUALITIES FOR SUMS OF BOUNDED RANDOM VARIABLES – Wassily Hoeffding - 1962
579 Optimization, Approximation, and Complexity Classes – C H Papadiitriou, M Yannakakis - 1991
1923 Randomized Algorithms – Rajeev Motwani - 1995
2429 Monotone Complexity – Michelangelo Grigni , Michael Sipser - 1990