Verwandte Artikel zu Gems of Combinatorial Optimization and Graph Algorithms
Críticas
“Seventeen former advisees of Rolf H. Möhring contributed to this collection with fourteen short essays, on the occasion of his retirement. The result is a beautiful collection of results in combinatorial optimization, graph algorithms, algorithmic game theory and computational geometry, each suitable as a basis for a lecture or two in an advanced undergraduate or a graduate course. ... Nice examples, high quality illustrations and suggestion for further reading at the end of each chapter make the book truly valuable.” (András Recski, Mathematical Reviews, October, 2016)
Reseña del editor
Are you looking for new lectures for your course on algorithms, combinatorial optimization, or algorithmic game theory? Maybe you need a convenient source of relevant, current topics for a graduate student or advanced undergraduate student seminar? Or perhaps you just want an enjoyable look at some beautiful mathematical and algorithmic results, ideas, proofs, concepts, and techniques in discrete mathematics and theoretical computer science?
Gems of Combinatorial Optimization and Graph Algorithms is a handpicked collection of up-to-date articles, carefully prepared by a select group of international experts, who have contributed some of their most mathematically or algorithmically elegant ideas. Topics include longest tours and Steiner trees in geometric spaces, cartograms, resource buying games, congestion games, selfish routing, revenue equivalence and shortest paths, scheduling, linear structures in graphs, contraction hierarchies, budgeted matching problems, and motifs in networks.
This volume is aimed at readers with some familiarity of combinatorial optimization, and appeals to researchers, graduate students, and advanced undergraduate students alike.
„Über diesen Titel“ kann sich auf eine andere Ausgabe dieses Titels beziehen.
- VerlagSpringer
- Erscheinungsdatum2018
- ISBN 10 3319797115
- ISBN 13 9783319797113
- EinbandTapa blanda
- SpracheEnglisch
- Anzahl der Seiten160
- HerausgeberSchulz Andreas S., Skutella Martin, Stiller Sebastian, Wagner Dorothea
Neu kaufen
Diesen Artikel anzeigen
EUR 67,83
EUR 3,52 für den Versand innerhalb von/der USA
Versandziele, Kosten & DauerWeitere beliebte Ausgaben desselben Titels
Suchergebnisse für Gems of Combinatorial Optimization and Graph Algorithms
Beispielbild für diese ISBN
Gems of Combinatorial Optimization and Graph Algorithms
Anbieter: Lucky's Textbooks, Dallas, TX, USA
Verkäuferbewertung 5 von 5 Sternen
Zustand: New. Bestandsnummer des Verkäufers ABLIING23Mar3113020106239
Anzahl: Mehr als 20 verfügbar
Beispielbild für diese ISBN
Gems of Combinatorial Optimization and Graph Algorithms
Anbieter: Ria Christie Collections, Uxbridge, Vereinigtes Königreich
Verkäuferbewertung 5 von 5 Sternen
Zustand: New. In. Bestandsnummer des Verkäufers ria9783319797113_new
Anzahl: Mehr als 20 verfügbar
Beispielbild für diese ISBN
Gems of Combinatorial Optimization and Graph Algorithms
Anbieter: Chiron Media, Wallingford, Vereinigtes Königreich
Verkäuferbewertung 5 von 5 Sternen
Paperback. Zustand: New. Bestandsnummer des Verkäufers 6666-IUK-9783319797113
Anzahl: 10 verfügbar
Foto des Verkäufers
Gems of Combinatorial Optimization and Graph Algorithms
Verlag:
Springer International Publishing Mrz 2018, 2018
ISBN 10: 3319797115
ISBN 13: 9783319797113
Neu
Taschenbuch
Anbieter: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Deutschland
Verkäuferbewertung 5 von 5 Sternen
Taschenbuch. Zustand: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -Are you looking for new lectures for your course on algorithms, combinatorial optimization, or algorithmic game theory Maybe you need a convenient source of relevant, current topics for a graduate student or advanced undergraduate student seminar Or perhaps you just want an enjoyable look at some beautiful mathematical and algorithmic results, ideas, proofs, concepts, and techniques in discrete mathematics and theoretical computer science Gems of Combinatorial Optimization and Graph Algorithms is a handpicked collection of up-to-date articles, carefully prepared by a select group of international experts, who have contributed some of their most mathematically or algorithmically elegant ideas. Topics include longest tours and Steiner trees in geometric spaces, cartograms, resource buying games, congestion games, selfish routing, revenue equivalence and shortest paths, scheduling, linear structures in graphs, contraction hierarchies, budgeted matching problems, and motifs in networks.This volume is aimed at readers with some familiarity of combinatorial optimization, and appeals to researchers, graduate students, and advanced undergraduate students alike. 160 pp. Englisch. Bestandsnummer des Verkäufers 9783319797113
Anzahl: 2 verfügbar
Foto des Verkäufers
Gems of Combinatorial Optimization and Graph Algorithms
ISBN 10: 3319797115
ISBN 13: 9783319797113
Neu
Taschenbuch
Anbieter: AHA-BUCH GmbH, Einbeck, Deutschland
Verkäuferbewertung 5 von 5 Sternen
Taschenbuch. Zustand: Neu. Druck auf Anfrage Neuware - Printed after ordering - Are you looking for new lectures for your course on algorithms, combinatorial optimization, or algorithmic game theory Maybe you need a convenient source of relevant, current topics for a graduate student or advanced undergraduate student seminar Or perhaps you just want an enjoyable look at some beautiful mathematical and algorithmic results, ideas, proofs, concepts, and techniques in discrete mathematics and theoretical computer science Gems of Combinatorial Optimization and Graph Algorithms is a handpicked collection of up-to-date articles, carefully prepared by a select group of international experts, who have contributed some of their most mathematically or algorithmically elegant ideas. Topics include longest tours and Steiner trees in geometric spaces, cartograms, resource buying games, congestion games, selfish routing, revenue equivalence and shortest paths, scheduling, linear structures in graphs, contraction hierarchies, budgeted matching problems, and motifs in networks.This volume is aimed at readers with some familiarity of combinatorial optimization, and appeals to researchers, graduate students, and advanced undergraduate students alike. Bestandsnummer des Verkäufers 9783319797113
Anzahl: 1 verfügbar
Foto des Verkäufers
Gems of Combinatorial Optimization and Graph Algorithms
Verlag:
Springer International Publishing, 2018
ISBN 10: 3319797115
ISBN 13: 9783319797113
Neu
Softcover
Anbieter: moluna, Greven, Deutschland
Verkäuferbewertung 5 von 5 Sternen
Zustand: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. Some of the most beautiful results, concepts or algorithmic ideas from the authors own researchConcise, easy to read, self-contained chapters, focussing on a well-defined topicPointers to related work for furth. Bestandsnummer des Verkäufers 448755026
Anzahl: Mehr als 20 verfügbar
Beispielbild für diese ISBN
Gems of Combinatorial Optimization and Graph Algorithms
Anbieter: Mispah books, Redhill, SURRE, Vereinigtes Königreich
Verkäuferbewertung 4 von 5 Sternen
Paperback. Zustand: New. New. book. Bestandsnummer des Verkäufers ERICA80033197971156
Anzahl: 1 verfügbar