Probabilistic Combinatorial Optimization on Graphs (PDF)
(Sprache: Englisch)
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...
probabilistic combinatorial optimization, discussing probabilistic
versions of some of the most paradigmatic combinatorial problems on
graphs, such as the maximum independent set, the minimum...
sofort als Download lieferbar
eBook (pdf)
139.99 €
- Lastschrift, Kreditkarte, Paypal, Rechnung
- Kostenloser tolino webreader
Produktdetails
Produktinformationen zu „Probabilistic Combinatorial Optimization on Graphs (PDF)“
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.
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.
Autoren-Porträt von Cécile Murat, Vangelis Th. Paschos
Cécile Murat is Assistant Professor of Computer Scienceat 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.
Bibliographische Angaben
- Autoren: Cécile Murat , Vangelis Th. Paschos
- 2010, 1. Auflage, 268 Seiten, Englisch
- Verlag: John Wiley & Sons
- ISBN-10: 0470394641
- ISBN-13: 9780470394649
- Erscheinungsdatum: 12.01.2010
Abhängig von Bildschirmgröße und eingestellter Schriftgröße kann die Seitenzahl auf Ihrem Lesegerät variieren.
eBook Informationen
- Dateiformat: PDF
- Größe: 1.66 MB
- Mit Kopierschutz
Sprache:
Englisch
Kopierschutz
Dieses eBook können Sie uneingeschränkt auf allen Geräten der tolino Familie lesen. Zum Lesen auf sonstigen eReadern und am PC benötigen Sie eine Adobe ID.
Kommentar zu "Probabilistic Combinatorial Optimization on Graphs"
0 Gebrauchte Artikel zu „Probabilistic Combinatorial Optimization on Graphs“
| Zustand | Preis | Porto | Zahlung | Verkäufer | Rating |
|---|
Schreiben Sie einen Kommentar zu "Probabilistic Combinatorial Optimization on Graphs".
Kommentar verfassen