Gems of Combinatorial Optimization and Graph Algorithms
Buch in deiner Nähe kaufen
Beschreibung
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.
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.
Some of the most beautiful results, concepts or algorithmic ideas from the authors' own research Concise, easy to read, self-contained chapters, focussing on a well-defined topic Pointers to related work for further reading Ideal source of recent results that are not yet covered in other books Includes supplementary material: sn.pub/extras
Autor*in
Andreas S. Schulz
Themen in »Gems of Combinatorial Optimization and Graph Algorithms«
Lectures in combinatorial optimization Graph algorithms and network analysis Advanced topics in discrete mathematics Sequencing and scheduling Algorithmic game theory combinatorics
Stimmen zu »Gems of Combinatorial Optimization and Graph Algorithms«
“Seventeen former advisees of Rolf H. Möhring contributed to this collection with fourteen short essays, on the occasion of his retirement. The result is a beautiful collection of results in combinatorial optimization, graph algorithms, algorithmic game theory and computational geometry, each suitable as a basis for a lecture or two in an advanced undergraduate or a graduate course. … Nice examples, high quality illustrations and suggestion for further reading at the end of each chapter make the book truly valuable.” (András Recski, Mathematical Reviews, October, 2016)
()