Vendeur : GreatBookPrices, Columbia, MD, Etats-Unis
EUR 60,57
Autre deviseQuantité disponible : Plus de 20 disponibles
Ajouter au panierEtat : As New. Unread book in perfect condition.
Vendeur : Lucky's Textbooks, Dallas, TX, Etats-Unis
EUR 68,04
Autre deviseQuantité disponible : Plus de 20 disponibles
Ajouter au panierEtat : New.
Vendeur : Ria Christie Collections, Uxbridge, Royaume-Uni
EUR 74,15
Autre deviseQuantité disponible : Plus de 20 disponibles
Ajouter au panierEtat : New. In.
Vendeur : Chiron Media, Wallingford, Royaume-Uni
EUR 70,16
Autre deviseQuantité disponible : 10 disponible(s)
Ajouter au panierPaperback. Etat : New.
Vendeur : GreatBookPrices, Columbia, MD, Etats-Unis
EUR 97,88
Autre deviseQuantité disponible : Plus de 20 disponibles
Ajouter au panierEtat : New.
Vendeur : Lucky's Textbooks, Dallas, TX, Etats-Unis
EUR 96,66
Autre deviseQuantité disponible : Plus de 20 disponibles
Ajouter au panierEtat : New.
Edité par Springer International Publishing, Springer International Publishing, 2018
ISBN 10 : 3319797115 ISBN 13 : 9783319797113
Langue: anglais
Vendeur : AHA-BUCH GmbH, Einbeck, Allemagne
EUR 69,54
Autre deviseQuantité disponible : 1 disponible(s)
Ajouter au panierTaschenbuch. Etat : 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.
Vendeur : Mispah books, Redhill, SURRE, Royaume-Uni
EUR 82,35
Autre deviseQuantité disponible : 1 disponible(s)
Ajouter au panierPaperback. Etat : New. New. book.
Vendeur : GreatBookPricesUK, Woodford Green, Royaume-Uni
EUR 98,01
Autre deviseQuantité disponible : Plus de 20 disponibles
Ajouter au panierEtat : As New. Unread book in perfect condition.
Vendeur : California Books, Miami, FL, Etats-Unis
EUR 119,36
Autre deviseQuantité disponible : Plus de 20 disponibles
Ajouter au panierEtat : New.
Vendeur : Ria Christie Collections, Uxbridge, Royaume-Uni
EUR 105,63
Autre deviseQuantité disponible : Plus de 20 disponibles
Ajouter au panierEtat : New. In.
Vendeur : GreatBookPricesUK, Woodford Green, Royaume-Uni
EUR 105,62
Autre deviseQuantité disponible : Plus de 20 disponibles
Ajouter au panierEtat : New.
EUR 59,84
Autre deviseQuantité disponible : 1 disponible(s)
Ajouter au panierhardcover. Etat : Sehr gut. 160 Seiten; 9783319249704.2 Gewicht in Gramm: 1.
Edité par Springer International Publishing, 2016
ISBN 10 : 3319249703 ISBN 13 : 9783319249704
Langue: anglais
Vendeur : AHA-BUCH GmbH, Einbeck, Allemagne
EUR 96,29
Autre deviseQuantité disponible : 1 disponible(s)
Ajouter au panierBuch. Etat : 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.
Vendeur : Revaluation Books, Exeter, Royaume-Uni
EUR 141,79
Autre deviseQuantité disponible : 2 disponible(s)
Ajouter au panierHardcover. Etat : Brand New. 160 pages. 9.25x6.25x0.75 inches. In Stock.
Edité par Springer International Publishing Mrz 2018, 2018
ISBN 10 : 3319797115 ISBN 13 : 9783319797113
Langue: anglais
Vendeur : BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Allemagne
EUR 69,54
Autre deviseQuantité disponible : 2 disponible(s)
Ajouter au panierTaschenbuch. Etat : 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.
Edité par Springer International Publishing, 2018
ISBN 10 : 3319797115 ISBN 13 : 9783319797113
Langue: anglais
Vendeur : moluna, Greven, Allemagne
EUR 60,06
Autre deviseQuantité disponible : Plus de 20 disponibles
Ajouter au panierEtat : 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.
Edité par Springer International Publishing Jan 2016, 2016
ISBN 10 : 3319249703 ISBN 13 : 9783319249704
Langue: anglais
Vendeur : BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Allemagne
EUR 96,29
Autre deviseQuantité disponible : 2 disponible(s)
Ajouter au panierBuch. Etat : 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.
Edité par Springer International Publishing, 2016
ISBN 10 : 3319249703 ISBN 13 : 9783319249704
Langue: anglais
Vendeur : moluna, Greven, Allemagne
EUR 81,44
Autre deviseQuantité disponible : Plus de 20 disponibles
Ajouter au panierGebunden. Etat : 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.