Gems of Combinatorial Optimization and Graph Algorithms

Business & Finance, Management & Leadership, Operations Research, Nonfiction, Computers, Programming
Cover of the book Gems of Combinatorial Optimization and Graph Algorithms by , Springer International Publishing
View on Amazon View on AbeBooks View on Kobo View on B.Depository View on eBay View on Walmart
Author: ISBN: 9783319249711
Publisher: Springer International Publishing Publication: January 31, 2016
Imprint: Springer Language: English
Author:
ISBN: 9783319249711
Publisher: Springer International Publishing
Publication: January 31, 2016
Imprint: Springer
Language: English

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.

View on Amazon View on AbeBooks View on Kobo View on B.Depository View on eBay View on Walmart

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.

More books from Springer International Publishing

Cover of the book Meta-heuristic Algorithms for Optimal Design of Real-Size Structures by
Cover of the book Arms Control and Disarmament by
Cover of the book Rethinking Resilience, Adaptation and Transformation in a Time of Change by
Cover of the book FIB Nanostructures by
Cover of the book Algebra by
Cover of the book Building Refurbishment for Energy Performance by
Cover of the book Stagnation Versus Growth in Europe by
Cover of the book Communications and Networking by
Cover of the book Mechatronics: Ideas, Challenges, Solutions and Applications by
Cover of the book Mathematical Modelling for Teachers by
Cover of the book Mapping Asia: Cartographic Encounters Between East and West by
Cover of the book Electronic Participation by
Cover of the book Oral Infections and General Health by
Cover of the book Stability of Non-Linear Constitutive Formulations for Viscoelastic Fluids by
Cover of the book Guide to Security in SDN and NFV by
We use our own "cookies" and third party cookies to improve services and to see statistical information. By using this website, you agree to our Privacy Policy