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...
Saved in:
| Main Author: | |
|---|---|
| Other Authors: | |
| Format: | Electronic eBook |
| Language: | English |
| Published: |
London ; Newport Beach, CA :
ISTE,
2006.
|
| Subjects: | |
| Online Access: | CONNECT |
| Summary: | 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. Detailed discussion is given to a priori optimization, which is adopted as the main working hypothesis: starting from an a priori solution of a super instance of a problem, where any datum is present with a certain probability, this hypothesis consists of creating modifications in or. |
|---|---|
| Item Description: | Wiley EBA |
| Physical Description: | 1 online resource (267 pages) : illustrations |
| Bibliography: | Includes bibliographical references (pages 255-259) and index. |
| ISBN: | 9780470612507 0470612509 9781847045836 1847045839 1280510617 9781280510618 |
