Compatible sequences and a slow Winkler percolation

DOI10.1145/380752.380874zbMath1323.60129OpenAlexW2001729260MaRDI QIDQ5176028

Peter Gács

Publication date: 27 February 2015

Published in: Proceedings of the thirty-third annual ACM symposium on Theory of computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/380752.380874

zbMATH Keywords

schedulingdistributed computingdependent percolation

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Graph theory (including graph drawing) in computer science (68R10) Interacting random processes; statistical mechanics type models; percolation theory (60K35) Combinatorial probability (60C05) Random walks, random surfaces, lattice animals, etc. in equilibrium statistical mechanics (82B41)

Cites Work

• A constant-factor approximation algorithm for the k -median problem (extended abstract)

This page was built for publication: Compatible sequences and a slow Winkler percolation