Probabilistic Combinatorial Optimization on Graphs

Probabilistic Combinatorial Optimization on Graphs

Autor: Vangelis Th. Paschos, Cécile Murat
Wydawca: Wiley
Wydanie: 1
Data publikacji: 2013
ISBN: 9781905209330

Wybierz, jak chcesz czytać

0

Zapłać z Klarna
14-dniowa gwarancja zwrotu pieniędzy
This title provides a comprehensive survey over the subject of probabilistic combinatorial optimization, discussing probabilistic versions of some of the most paradigmatic combinatorial problems on graphs, such as the maximum independent set, the minimum vertex covering, the longest path and the minimum coloring.

Those who possess a sound knowledge of the subject mater will find the title of great interest, but those who have only some mathematical familiarity and knowledge about complexity and approximation theory will also find it an accessible and informative read.

Może Ci się spodobać