Probabilistic Combinatorial Optimization on Graphs e-bog
1313,81 DKK
(inkl. moms 1642,26 DKK)
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 g...
E-bog
1313,81 DKK
Forlag
Wiley-ISTE
Udgivet
5 januar 2010
Genrer
Mathematics
Sprog
English
Format
pdf
Beskyttelse
LCP
ISBN
9780470394649
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.