Probabilistic Combinatorial Optimization on Graphs

by Vangelis Th. Paschos and Cécile Murat

This book deals with probabilistic combinatorial optimization. It discusses 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 colouring. The main working hypothesis adopted is called a priori optimization. Starting from a priori solution of a 'super-instance' of a problem, where any datum is present with a certain...

• Format: Hardcover
• Language: English
• ISBN: 1905209339
• ISBN13: 9781905209330
• Release Date: March 2006
• Publisher: Wiley-Iste
• Length: 267 Pages
• Weight: 1.18 lbs.
• Dimensions: 0.8" x 6.4" x 9.3"