Random generation of combinatorial structures from a uniform
Theoretical Computer Science
A random polynomial-time algorithm for approximating the volume of convex bodies
Journal of the ACM (JACM)
Sampling and integration of near log-concave functions
STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
Random walks and an O*(n5) volume algorithm for convex bodies
Random Structures & Algorithms
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Solving convex programs by random walks
Journal of the ACM (JACM)
The mixing rate of Markov chains, an isoperimetric inequality, and computing the volume
SFCS '90 Proceedings of the 31st Annual Symposium on Foundations of Computer Science
On the randomized complexity of volume and diameter
SFCS '92 Proceedings of the 33rd Annual Symposium on Foundations of Computer Science
Simulated Annealing for Convex Optimization
Mathematics of Operations Research
Large margin vs. large volume in transductive learning
Machine Learning
Adaptive simulated annealing: A near-optimal connection between sampling and counting
Journal of the ACM (JACM)
Using Histograms to Better Answer Queries to Probabilistic Logic Programs
ICLP '09 Proceedings of the 25th International Conference on Logic Programming
Sampling s-Concave Functions: The Limit of Convexity Based Isoperimetry
APPROX '09 / RANDOM '09 Proceedings of the 12th International Workshop and 13th International Workshop on Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
Improved Approximations for Stochastic Loss Networks
ACM SIGMETRICS Performance Evaluation Review
Improved approximations for the Erlang loss model
Queueing Systems: Theory and Applications
Approximating the volume of unions and intersections of high-dimensional geometric objects
Computational Geometry: Theory and Applications
Thin partitions: isoperimetric inequalities and a sampling algorithm for star shaped bodies
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Liftings of tree-structured Markov chains
APPROX/RANDOM'10 Proceedings of the 13th international conference on Approximation, and 14 the International conference on Randomization, and combinatorial optimization: algorithms and techniques
Using markov-chain mixing time estimates for the analysis of ant colony optimization
Proceedings of the 11th workshop proceedings on Foundations of genetic algorithms
Efficient circuits for quantum walks
Quantum Information & Computation
Sampling hidden objects using nearest-neighbor oracles
Proceedings of the 17th ACM SIGKDD international conference on Knowledge discovery and data mining
Lattice enumeration using extreme pruning
EUROCRYPT'10 Proceedings of the 29th Annual international conference on Theory and Applications of Cryptographic Techniques
Unconditional differentially private mechanisms for linear queries
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
A dynamic programming approach to efficient sampling from Boltzmann distributions
Operations Research Letters
Approximating the stability region for binary mixed-integer programs
Operations Research Letters
Optimization of a convex program with a polynomial perturbation
Operations Research Letters
A Deterministic Polynomial-Time Approximation Scheme for Counting Knapsack Solutions
SIAM Journal on Computing
Hitting time of quantum walks with perturbation
Quantum Information Processing
Markov chains, Hamiltonian cycles and volumes of convex bodies
Journal of Global Optimization
The approximate rank of a matrix and its algorithmic applications: approximate rank
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
An empirical evaluation of walk-and-round heuristics for mixed integer linear programs
Computational Optimization and Applications
| Hi-index | 0.00 |
We present a new algorithm for computing the volume of a convex body in R^n. The main ingredients of the algorithm are (i) a ''morphing'' technique that can be viewed as a variant of simulated annealing and (ii) a new rounding algorithm to put a convex body in near-isotropic position. The complexity is O^*(n^4), improving on the previous best algorithm by a factor of n.