Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques

DOI10.1007/11538462zbMath1142.68623OpenAlexW2649657569MaRDI QIDQ5479387

Remi Monasson

Publication date: 7 July 2006

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

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Analysis of algorithms (68W40) Exact enumeration problems, generating functions (05A15) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items (2)

Complexity of Coloring Random Graphs ⋮ Average-case complexity of backtrack search for coloring sparse random graphs

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