Home » Probabilistic Combinatorial Optimization on Graphs
Product Image

Probabilistic Combinatorial Optimization on Graphs

Cécile Murat | Vangelis Th. Paschos
€172.30
Quantity:
In stock with our UK publisher. 14-28 days
Delivery/Collection within 10-20 working days
14 days return policy Shipping & Delivery
A01=Cecile Murat
A01=Vangelis Th. Paschos
Author_Cecile Murat
Author_Vangelis Th. Paschos
Category=PBV
combinatorial
discussing
eq_isMigrated=1
eq_isMigrated=2
eq_nobargain
graphs
great
knowledge
longest
mater
maximum independent
minimum coloring
optimization
paradigmatic
probabilistic
problems
subject
survey
theory
title
versions

Product details

  • ISBN 9781905209330
  • Weight: 535g
  • Dimensions: 161 x 243mm
  • Publication Date: 08 Mar 2006
  • Publisher: ISTE Ltd and John Wiley & Sons Inc
  • Publication City/Country: GB
  • Product Form: Hardback
Secure checkout Fast Shipping Easy returns
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.

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.
About Cecile Murat | Vangelis Th. Paschos
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 University of Paris-Dauphine and Chairman of the LAMSADE (Laboratory for the Modeling and the Analysis of Decision Aiding Systems). His research interests include complexity theory, the theory of the polynomial approximation of NP-hard problems, probabilistic combinatorial optimization and on-line computation. He is the author of more than a 100 research papers and is a member of the editorial board of several international scientific journals.

More from this author