Gems of Combinatorial Optimization and Graph Algorithms

Andreas S. Schulz

ISBN 10: 3319797115 / ISBN 13: 9783319797113

Edité par Springer International Publishing Mrz 2018, 2018

A propos de cet article

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. N° de réf. du vendeur 9783319797113

Détails bibliographiques

Titre : Gems of Combinatorial Optimization and Graph...

Éditeur : Springer International Publishing Mrz 2018

Date d'édition : 2018

Reliure : Taschenbuch

Etat : Neu