Gems of Combinatorial Optimization and Graph Algorithms

Andreas S. Schulz (Curatore)

Martin Skutella (Curatore)

Springer International Publishing AG, 2016

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.

• Curatore: Andreas S. Schulz, Martin Skutella
• Editore: Springer International Publishing AG
• Anno: 2016
• Rilegatura: Hardback
• Pagine: 150 p.
• Dimensioni: 235 x 155 mm
• EAN: 9783319249704

Testo in English