Probabilistic Combinatorial Optimization on Graphs

English

Series: Iste Ser.

Volume: 639

ISBN: 0470394641

EAN: 9780470394649

Category: Mathematics / Combinatorics

Publisher: Wiley-ISTE

Release Date: 01/05/2010

Synopsis: 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.

Excerpt: Unknown Property Excerpt

Probabilistic Combinatorial Optimization on Graphs

Illustrated: No

Format: eBook - PDF

Pages: 267