Murat C., Paschos V.Th. — Probabilistic Combinatorial Optimization on Graphs
Обсудите книгу на
Нашли опечатку? Выделите ее мышкой и нажмите Ctrl+Enter
Название: Probabilistic Combinatorial Optimization on Graphs
Авторы: Murat C., Paschos V.Th.
Аннотация:
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.
|
|
О проекте