Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques

DOI10.1007/11538462zbMath1142.68624OpenAlexW2649657569MaRDI QIDQ5479389

Dana Randall, Peter M. Winkler

Publication date: 7 July 2006

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11538462

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Interacting particle systems in time-dependent statistical mechanics (82C22) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Applications of Markov chains and discrete-time Markov processes on general state spaces (social mobility, learning theory, industrial processes, etc.) (60J20) Approximation algorithms (68W25) Randomized algorithms (68W20)

Related Items (6)

Polynomial time approximate or perfect samplers for discretized Dirichlet distribution ⋮ Mixing time and cutoff for one-dimensional particle systems ⋮ Mixing time of the adjacent walk on the simplex ⋮ A Gibbs sampler on the \(n\)-simplex ⋮ Analysis of convergence rates of some Gibbs samplers on continuous state spaces ⋮ Birthday inequalities, repulsion, and hard spheres

This page was built for publication: Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques