Librería: GreatBookPrices, Columbia, MD, Estados Unidos de America
EUR 46,42
Cantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: As New. Unread book in perfect condition.
Librería: GreatBookPrices, Columbia, MD, Estados Unidos de America
EUR 86,27
Cantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: New.
Librería: Ria Christie Collections, Uxbridge, Reino Unido
EUR 103,58
Cantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: New. In.
Librería: GreatBookPricesUK, Woodford Green, Reino Unido
EUR 103,57
Cantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: New.
Librería: GreatBookPricesUK, Woodford Green, Reino Unido
EUR 117,92
Cantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: As New. Unread book in perfect condition.
Librería: Books Puddle, New York, NY, Estados Unidos de America
EUR 132,17
Cantidad disponible: 4 disponibles
Añadir al carritoCondición: New. pp.
Librería: Revaluation Books, Exeter, Reino Unido
EUR 142,30
Cantidad disponible: 2 disponibles
Añadir al carritoHardcover. Condición: Brand New. 160 pages. 9.25x6.25x0.75 inches. In Stock.
Librería: Brook Bookstore On Demand, Napoli, NA, Italia
EUR 78,24
Cantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: new. Questo è un articolo print on demand.
Idioma: Inglés
Publicado por Springer International Publishing Jan 2016, 2016
ISBN 10: 3319249703 ISBN 13: 9783319249704
Librería: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Alemania
EUR 96,29
Cantidad disponible: 2 disponibles
Añadir al carritoBuch. Condición: 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.
Idioma: Inglés
Publicado por Springer International Publishing, 2016
ISBN 10: 3319249703 ISBN 13: 9783319249704
Librería: moluna, Greven, Alemania
EUR 81,44
Cantidad disponible: Más de 20 disponibles
Añadir al carritoGebunden. Condición: 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.
Librería: Majestic Books, Hounslow, Reino Unido
EUR 136,36
Cantidad disponible: 4 disponibles
Añadir al carritoCondición: New. Print on Demand pp.
Librería: Biblios, Frankfurt am main, HESSE, Alemania
EUR 135,54
Cantidad disponible: 4 disponibles
Añadir al carritoCondición: New. PRINT ON DEMAND pp.
Idioma: Inglés
Publicado por Palgrave Macmillan, Springer Jan 2016, 2016
ISBN 10: 3319249703 ISBN 13: 9783319249704
Librería: buchversandmimpf2000, Emtmannsberg, BAYE, Alemania
EUR 96,29
Cantidad disponible: 1 disponibles
Añadir al carritoBuch. Condición: Neu. This item is printed on demand - Print on Demand Titel. 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.Springer-Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg 160 pp. Englisch.
Idioma: Inglés
Publicado por Palgrave Macmillan, Springer, 2016
ISBN 10: 3319249703 ISBN 13: 9783319249704
Librería: AHA-BUCH GmbH, Einbeck, Alemania
EUR 96,29
Cantidad disponible: 1 disponibles
Añadir al carritoBuch. Condición: Neu. nach der Bestellung gedruckt 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.