Stock image for illustration purposes only - book cover, edition or condition may vary.
Probabilistic Combinatorial Optimization on Graphs
Murat
€ 173.05
FREE Delivery in Ireland
Description for Probabilistic Combinatorial Optimization on Graphs
Hardcover. 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. Num Pages: 268 pages, Illustrations. BIC Classification: PBV. Category: (P) Professional & Vocational. Dimension: 240 x 162 x 23. Weight in Grams: 533.
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.
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.
Product Details
Format
Hardback
Publication date
2006
Publisher
ISTE United Kingdom
Number of pages
268
Condition
New
Number of Pages
267
Place of Publication
London, United Kingdom
ISBN
9781905209330
SKU
V9781905209330
Shipping Time
Usually ships in 15 to 20 working days
Ref
99-15
About Murat
Cécile Murat is Assistant Professor of Computer Science at the University of Paris-Dauphine. Her research interests include combinatorial and probabilistic combinatorial optimization, the design and analysis of efficient algorithms and the design of efficient solutions for hard combinatorial optimization problems. She is the author of over 20 research papers. Vangelis Th. Paschos is Professor of Computer Science at the ... Read more
Reviews for Probabilistic Combinatorial Optimization on Graphs