Login

Murat, Cécile

Probabilistic Combinatorial Optimization on Graphs

Murat, Cécile - Probabilistic Combinatorial Optimization on Graphs, ebook

DRM Restrictions

Printing30 pages with an additional page accrued every day, capped at 30 pages
Copy to clipboard5 excerpts

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.

Keywords: combinatorial; survey; optimization; probabilistic; title; subject; discussing; graphs; paradigmatic; problems; versions; maximum independent; longest; minimum coloring; great; knowledge; mater; theory, Information Technologies, Information Technologies

Author(s)
 
Publisher
John Wiley and Sons, Inc.
Publication year
2006
Language
en
Edition
1
Series
ISTE
Page amount
267 pages
Category
Natural Sciences
Format
Ebook
eISBN (ePUB)
9781118614136
Printed ISBN
9781905209330

Similar titles