A very simple algorithm for estimating the number of k-colorings of a low-degree graph
Random Structures & Algorithms
A constant-factor approximation algorithm for the k-median problem (extended abstract)
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
On Approximately Counting Colorings of Small Degree Graphs
SIAM Journal on Computing
Local search heuristic for k-median and facility location problems
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Markov Chain Algorithms for Planar Lattice Structures
SIAM Journal on Computing
Strong Spatial Mixing for Lattice Graphs with Fewer Colours
FOCS '04 Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science
Random sampling of 3-colorings in ℤ2
Random Structures & Algorithms - Isaac Newton Institute Programme “Computation, Combinatorics and Probability”: Part I
A constant factor approximation algorithm for k-median clustering with outliers
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Hi-index | 0.00 |