Probabilistic Combinatorial Optimization on Graphs (Hardback)
  • Probabilistic Combinatorial Optimization on Graphs (Hardback)

Probabilistic Combinatorial Optimization on Graphs (Hardback)

(author), (author)
Hardback 268 Pages / Published: 08/03/2006
  • We can order this

Usually dispatched within 3 weeks

  • This item has been added to your basket
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.

Publisher: ISTE Ltd
ISBN: 9781905209330
Number of pages: 268
Weight: 524 g
Dimensions: 237 x 164 x 20 mm

You may also be interested in...

Combinatorial Optimization
Added to basket
Introduction to Graph Theory
Added to basket
Proofs and Fundamentals
Added to basket
A Combinatorial Introduction to Topology
Added to basket
Proofs from THE BOOK
Added to basket
Problems in Probability
Added to basket
Discrete Mathematics
Added to basket


Please sign in to write a review

Your review has been submitted successfully.