This comprehensive survey requires only some mathematical understanding and knowledge about complexity and approximation theory and covers some of the most paradigmatic combinatorial problems on graphs, such as the maximum-independent set, minimum-vertex covering, longest path, and minimum coloring.

Читать «Probabilistic Combinatorial Optimization on Graphs»

Купить электронную версию