Probabilistic combinatorial optimization on graphs
Auteur :
Murat, Cécile / Paschos, Vangelis Th.
Éditeur :
ISTE Ltd and John Wiley & Sons Inc
ISBN :
9781905209330
Date de publication :
8 mars 2006
Dimensions :
24,3 x 16,1 x 2,0 cm
Poids :
535 g
Langue :
Anglais
Pays d'origine :
Grande Bretagne
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.