Cantitate/Preț
Produs

Probabilistic Combinatorial Optimization on Graphs

Autor Cécile Murat, Vangelis Th Paschos
en Limba Engleză Hardback – apr 2006
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.
Citește tot Restrânge

Preț: 97658 lei

Preț vechi: 126829 lei
-23%

Puncte Express: 1465

Carte disponibilă

Livrare economică 22 iunie-06 iulie
Livrare express 05-11 iunie pentru 3452 lei

Livrare prin curier în România Termenul estimat este afișat lângă disponibilitate.
Transport gratuit pentru acest produs Plată online sau ramburs, în funcție de opțiunile comenzii.
Retur gratuit în 14 zile Comandă securizată și suport în română.

Specificații

ISBN-13: 9781905209330
ISBN-10: 1905209339
Pagini: 267
Dimensiuni: 162 x 235 x 19 mm
Greutate: 0.54 kg
Editura: Wiley
Locul publicării:Hoboken, United States

Public țintă

Applied Mathematicians; Computer Scientists; Statisticians; Students.

Notă biografică

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.