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 New Political Ideas in the Aftermath of the Great War by
Cover of the book 9th WCEAM Research Papers by
Cover of the book Selected Areas in Cryptography – SAC 2017 by
Cover of the book Lectures on Quantum Mechanics by
Cover of the book Update in Pediatrics by
Cover of the book Innovative Algorithms and Analysis by
Cover of the book The Milan System for Reporting Salivary Gland Cytopathology by
Cover of the book Industry 4.0 by
Cover of the book Formalizing Data-Centric Web Services by
Cover of the book Online Political Communication by
Cover of the book Fracture at all Scales by
Cover of the book Monitoring Tissue Perfusion in Shock by
Cover of the book Women’s Manga in Asia and Beyond by
Cover of the book Pancreas and Biliary Disease by
Cover of the book Nutritional Influences on Bone Health 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