Cantitate/Preț
Produs
Total produse
Vezi coșul
Probabilistic Combinatorial Optimization on Graphs de C Murat

Probabilistic Combinatorial Optimization on Graphs

Autor C Murat
en Limba Engleză Hardback – 7 mar 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ț: 78543 lei

Preț vechi: 116358 lei
-32% Nou

Puncte Express: 1178
Preț estimativ în valută:
15038€ • 15660$ • 12477£

Carte indisponibilă temporar


Wish list
Gift list
Am citit!
Adaugă în listă
Doresc să fiu notificat când acest titlu va fi disponibil:
Trimite
Preluare comenzi: 021 569.72.76

Specificații

ISBN-13: 9781905209330
ISBN-10: 1905209339
Pagini: 268
Dimensiuni: 164 x 237 x 20 mm
Greutate: 0.54 kg
Editura: ISTE Ltd.
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.