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
- Erscheinungsdatum2016
- ISBN 10 3319249703
- ISBN 13 9783319249704
- EinbandTapa dura
- SpracheEnglisch
- Auflage1
- Anzahl der Seiten160
Neu kaufen
Diesen Artikel anzeigen
EUR 96,59
EUR 3,53 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
Foto des Verkäufers
Gems of Combinatorial Optimization and Graph Algorithms
Anbieter: GreatBookPrices, Columbia, MD, USA
Verkäuferbewertung 5 von 5 Sternen
Zustand: As New. Unread book in perfect condition. Bestandsnummer des Verkäufers 24711027
Anzahl: Mehr als 20 verfügbar
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 ABLIING23Mar3113020091725
Anzahl: Mehr als 20 verfügbar
Foto des Verkäufers
Gems of Combinatorial Optimization and Graph Algorithms
Anbieter: GreatBookPrices, Columbia, MD, USA
Verkäuferbewertung 5 von 5 Sternen
Zustand: New. Bestandsnummer des Verkäufers 24711027-n
Anzahl: Mehr als 20 verfügbar
Foto des Verkäufers
Gems of Combinatorial Optimization and Graph Algorithms
Anbieter: GreatBookPricesUK, Woodford Green, Vereinigtes Königreich
Verkäuferbewertung 5 von 5 Sternen
Zustand: As New. Unread book in perfect condition. Bestandsnummer des Verkäufers 24711027
Anzahl: Mehr als 20 verfügbar
Beispielbild für diese ISBN
Gems of Combinatorial Optimization and Graph Algorithms
Anbieter: California Books, Miami, FL, USA
Verkäuferbewertung 5 von 5 Sternen
Zustand: New. Bestandsnummer des Verkäufers I-9783319249704
Anzahl: Mehr als 20 verfügbar
Foto des Verkäufers
Gems of Combinatorial Optimization and Graph Algorithms
Verlag:
Springer International Publishing Jan 2016, 2016
ISBN 10: 3319249703
ISBN 13: 9783319249704
Neu
Hardcover
Anbieter: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Deutschland
Verkäuferbewertung 5 von 5 Sternen
Buch. 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 9783319249704
Anzahl: 2 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 ria9783319249704_new
Anzahl: Mehr als 20 verfügbar
Foto des Verkäufers
Gems of Combinatorial Optimization and Graph Algorithms
Anbieter: Studibuch, Stuttgart, Deutschland
Verkäuferbewertung 5 von 5 Sternen
hardcover. Zustand: Sehr gut. 160 Seiten; 9783319249704.2 Gewicht in Gramm: 1. Bestandsnummer des Verkäufers 818476
Anzahl: 1 verfügbar
Foto des Verkäufers
Gems of Combinatorial Optimization and Graph Algorithms
Anbieter: GreatBookPricesUK, Woodford Green, Vereinigtes Königreich
Verkäuferbewertung 5 von 5 Sternen
Zustand: New. Bestandsnummer des Verkäufers 24711027-n
Anzahl: Mehr als 20 verfügbar
Foto des Verkäufers
Gems of Combinatorial Optimization and Graph Algorithms
Verlag:
Springer International Publishing, 2016
ISBN 10: 3319249703
ISBN 13: 9783319249704
Neu
Hardcover
Anbieter: AHA-BUCH GmbH, Einbeck, Deutschland
Verkäuferbewertung 5 von 5 Sternen
Buch. 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 9783319249704
Anzahl: 1 verfügbar