Probabilistic combinatorial optimization on graphs /

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 min...

Full description

Saved in:
Bibliographic Details
Main Author: Murat, Cecile
Other Authors: Paschos, Vangelis Th
Format: Electronic eBook
Language:English
Published: London ; Newport Beach, CA : ISTE, 2006.
Subjects:
Online Access:CONNECT