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...
| Main Author: | |
|---|---|
| Corporate Author: | |
| Other Authors: | |
| Format: | Electronic Book |
| Language: | English |
| Published: |
London ; Newport Beach, CA :
ISTE,
2006
|
| Subjects: |
Internet
This item is not available through BorrowDirect. Please contact your institution’s interlibrary loan office for further assistance.Stanford University
| Call Number: |
ISIL:US-CST |
|---|