Probabilistic Combinatorial Optimization on Graphs
Murat, Cecile (University of Paris-Dauphine, Paschos, Vangelis Th. (University of Paris-Dauphine
Description
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.
I have a question about the book:
'Probabilistic Combinatorial Optimization on Graphs - Murat, Cecile (University of Paris-Dauphine, Paschos, Vangelis Th. (University of Paris-Dauphine'.
Fill in the form below.
We will respond as fast as possible.
We value your privacy
We use cookies to measure traffic, improve Boekstra and let Google tailor ads to your interests. You can keep using the site either way — even if you decline. More info
