Hill-climbing finds random planted bisections
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
General partitioning on random graphs
Journal of Algorithms
Improved Algorithms for the Random Cluster Graph Model
SWAT '02 Proceedings of the 8th Scandinavian Workshop on Algorithm Theory
Hill-Climbing vs. Simulated Annealing for Planted Bisection Problems
APPROX '01/RANDOM '01 Proceedings of the 4th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems and 5th International Workshop on Randomization and Approximation Techniques in Computer Science: Approximation, Randomization and Combinatorial Optimization
Approximation algorithms for semi-random partitioning problems
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
Sorting noisy data with partial information
Proceedings of the 4th conference on Innovations in Theoretical Computer Science
FENNEL: streaming graph partitioning for massive scale graphs
Proceedings of the 7th ACM international conference on Web search and data mining
| Hi-index | 0.00 |