Gems of Combinatorial Optimization and Graph Algorithms
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 semi
- PDF / 3,485,756 Bytes
- 153 Pages / 453.543 x 683.15 pts Page_size
- 92 Downloads / 277 Views
Gems of Combinatorial Optimization and Graph Algorithms
Gems of Combinatorial Optimization and Graph Algorithms
Andreas S. Schulz Martin Skutella Sebastian Stiller Dorothea Wagner •
•
Editors
Gems of Combinatorial Optimization and Graph Algorithms
123
Editors Andreas S. Schulz Technische Universität München Munich Germany
Sebastian Stiller Technische Universität Braunschweig Braunschweig Germany
Martin Skutella Technische Universität Berlin Berlin Germany
Dorothea Wagner Karlsruher Institut für Technologie Karlsruhe Germany
ISBN 978-3-319-24970-4 DOI 10.1007/978-3-319-24971-1
ISBN 978-3-319-24971-1
(eBook)
Library of Congress Control Number: 2015953249 Springer Cham Heidelberg New York Dordrecht London © Springer International Publishing Switzerland 2015 This work is subject to copyright. All rights are reserved by the Publisher, whether the whole or part of the material is concerned, specifically the rights of translation, reprinting, reuse of illustrations, recitation, broadcasting, reproduction on microfilms or in any other physical way, and transmission or information storage and retrieval, electronic adaptation, computer software, or by similar or dissimilar methodology now known or hereafter developed. The use of general descriptive names, registered names, trademarks, service marks, etc. in this publication does not imply, even in the absence of a specific statement, that such names are exempt from the relevant protective laws and regulations and therefore free for general use. The publisher, the authors and the editors are safe to assume that the advice and information in this book are believed to be true and accurate at the date of publication. Neither the publisher nor the authors or the editors give a warranty, express or implied, with respect to the material contained herein or for any errors or omissions that may have been made. Printed on acid-free paper Springer International Publishing AG Switzerland is part of Springer Science+Business Media (www.springer.com)
To the joint mentor of the contributors to this book, Prof. Dr. Rolf H. Möhring, on the occasion of his retirement.
Preface
This book is intended as an homage to Prof. Rolf H. Möhring, an accomplished leader in the field of combinatorial optimization and graph algorithms. We contacted his former advisees who have successfully launched their own academic careers. We asked them each to pick a topic that they thought would be both interesting and accessible to a wide audience with a basic knowledge of graphs, algorithms, and optimization. The result is this collection of beautiful results. The reader can learn about the connection between shortest paths and mechanism design, about the interplay of priority rules in scheduling and the existence of pure-strategy Nash equilibria in weighted congestion games, about the critical role played by matroids in the existence of pure-strategy Nash equilibria in resource-buying games, about some geometric commonality between proportional resource allocation and selfish flows, about using the
Data Loading...
