Publicado por Springer, 2018
ISBN 10: 3319797115 ISBN 13: 9783319797113
Librería: booksXpress, Bayonne, NJ, Estados Unidos de America
Soft Cover. Condición: new.
Publicado por Springer, 2018
ISBN 10: 3319797115 ISBN 13: 9783319797113
Librería: Lucky's Textbooks, Dallas, TX, Estados Unidos de America
Condición: New.
Publicado por Springer, 2018
ISBN 10: 3319797115 ISBN 13: 9783319797113
Librería: Ria Christie Collections, Uxbridge, Reino Unido
Condición: New. PRINT ON DEMAND Book; New; Fast Shipping from the UK. No. book.
Publicado por Springer 2018-03, 2018
ISBN 10: 3319797115 ISBN 13: 9783319797113
Librería: Chiron Media, Wallingford, Reino Unido
PF. Condición: New.
Publicado por Springer International Publishing Mrz 2018, 2018
ISBN 10: 3319797115 ISBN 13: 9783319797113
Librería: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Alemania
Taschenbuch. 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.
Publicado por Springer, 2016
ISBN 10: 3319249703 ISBN 13: 9783319249704
Librería: GreatBookPrices, Columbia, MD, Estados Unidos de America
Condición: New.
Publicado por Springer International Publishing, 2018
ISBN 10: 3319797115 ISBN 13: 9783319797113
Librería: AHA-BUCH GmbH, Einbeck, Alemania
Taschenbuch. Condición: 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.
Publicado por Springer International Publishing, 2018
ISBN 10: 3319797115 ISBN 13: 9783319797113
Librería: moluna, Greven, Alemania
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.
Publicado por Springer, 2016
ISBN 10: 3319249703 ISBN 13: 9783319249704
Librería: GreatBookPrices, Columbia, MD, Estados Unidos de America
Condición: As New. Unread book in perfect condition.
Publicado por Springer, 2016
ISBN 10: 3319249703 ISBN 13: 9783319249704
Librería: GreatBookPricesUK, Castle Donington, DERBY, Reino Unido
Condición: New.
Publicado por Springer International Publishing, 2016
ISBN 10: 3319249703 ISBN 13: 9783319249704
Librería: moluna, Greven, Alemania
Gebunden. 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.
Publicado por Springer, 2015
ISBN 10: 3319249703 ISBN 13: 9783319249704
Librería: Revaluation Books, Exeter, Reino Unido
Hardcover. Condición: Brand New. 160 pages. 9.25x6.25x0.75 inches. In Stock.
Publicado por Springer, 2016
ISBN 10: 3319249703 ISBN 13: 9783319249704
Librería: GreatBookPricesUK, Castle Donington, DERBY, Reino Unido
Condición: As New. Unread book in perfect condition.
Publicado por Springer, 2018
ISBN 10: 3319797115 ISBN 13: 9783319797113
Librería: Mispah books, Redhill, SURRE, Reino Unido
Paperback. Condición: New. New. book.