Verwandte Artikel zu Probabilistic Combinatorial Optimization on Graphs
Inhaltsangabe
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.
Die Inhaltsangabe kann sich auf eine andere Ausgabe dieses Titels beziehen.
Über die Autorin bzw. den Autor
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.
Von der hinteren Coverseite
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.
„Über diesen Titel“ kann sich auf eine andere Ausgabe dieses Titels beziehen.
Neu kaufen
Diesen Artikel anzeigen
EUR 41,76
Gratis für den Versand von USA nach Deutschland
Versandziele, Kosten & DauerSuchergebnisse für Probabilistic Combinatorial Optimization on Graphs
Beispielbild für diese ISBN
PROBABILISTIC COMBINATORIAL OPTIMIZATION OF GRAPHS (HB 2006)
Anbieter: Romtrade Corp., STERLING HEIGHTS, MI, USA
Verkäuferbewertung 5 von 5 Sternen
Zustand: New. This is a Brand-new US Edition. This Item may be shipped from US or any other country as we have multiple locations worldwide. Artikel-Nr. ABNR-79064
Anzahl: 5 verfügbar
Beispielbild für diese ISBN
Probabilistic Combinatorial Optimization On Graphs
Anbieter: Romtrade Corp., STERLING HEIGHTS, MI, USA
Verkäuferbewertung 5 von 5 Sternen
Zustand: New. This is a Brand-new US Edition. This Item may be shipped from US or any other country as we have multiple locations worldwide. Artikel-Nr. ABNR-183736
Anzahl: 1 verfügbar
Beispielbild für diese ISBN
Probabilistic Combinatorial Optimization on Graphs
Anbieter: Majestic Books, Hounslow, Vereinigtes Königreich
Verkäuferbewertung 5 von 5 Sternen
Zustand: New. pp. 268 Illus. Artikel-Nr. 7443513
Anzahl: 1 verfügbar
Foto des Verkäufers
Probabilistic Combinatorial Optimization on Graphs
Anbieter: moluna, Greven, Deutschland
Verkäuferbewertung 4 von 5 Sternen
Zustand: New. 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 ve. Artikel-Nr. 597153103
Anzahl: Mehr als 20 verfügbar
Beispielbild für diese ISBN
Probabilistic Combinatorial Optimization on Graphs
Anbieter: Kennys Bookstore, Olney, MD, USA
Verkäuferbewertung 5 von 5 Sternen
Zustand: New. 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. . 2006. 1st Edition. Hardcover. . . . . Books ship from the US and Ireland. Artikel-Nr. V9781905209330
Anzahl: 15 verfügbar