Research Trends in Combinatorial Optimization

The editors and authors dedicate this book to Bernhard Korte on the occasion of his seventieth birthday. We, the editors, are happy about the overwhelming feedback to our initiative to honor him with this book and with a workshop in Bonn on November 37,2008.Althoughthiswouldbeareasontolookback,wewouldratherliketolook forward and see what are the interesting research directions today. This book is written by leading experts in combinatorial optimization. All - pers were carefully reviewed, and eventually twenty-three of the invited papers were accepted for this book. The breadth of topics is typical for the eld: combinatorial optimization builds bridges between areas like combinatorics and graph theory, submodular functions and matroids, network ows and connectivity, approximation algorithms and mat- matical programming, computational geometry and polyhedral combinatorics. All these topics are related, and they are all addressed in this book. Combi- torial optimization is also known for its numerous applications. To limit the scope, however, this book is not primarily about applications, although some are mentioned at various places. Most papers in this volume are surveys that provide an excellent overview of an activeresearcharea,butthisbookalsocontainsmanynewresults.Highlightingmany of the currently most interesting research directions in combinatorial optimization, we hope that this book constitutes a good basis for future research in these areas.

Includes supplementary material: sn.pub/extras

Autorentext
László Lovász ist einer der Leiter der theoretischen Forschungsabteilung der Microsoft Corporation. Er hat 1999 den Wolf-Preis sowie den Gödel-Preis für die beste wissenschaftliche Veröffentlichung in der Informatik erhalten. Jens Vygen ist Professor an der Universität Bonn. Seine Arbeitsgebiete sind kombinatorische Optimierung und Chip Design.

Inhalt
On the Location and p-Median Polytopes.- Facet Generating Techniques.- Antimatroids, Betweenness, Convexity.- Euler Complexes.- Strongly Polynomial Algorithm for the Intersection of a Line with a Polymatroid.- A Survey on Covering Supermodular Functions.- Theory of Principal Partitions Revisited.- Locally Dense Independent Sets in Regular Graphs of Large GirthAn Example of a New Approach.- Linear Time Approximation Algorithms for Degree Constrained Subgraph Problems.- The Unbounded Knapsack Problem.- Recent Developments in Discrete Convex Analysis.- Multiflow Feasibility: An Annotated Tableau.- Many Facets of Dualities.- On the Structure of Graphs Vertex Critical with Respect to Connected Domination.- LS-LIB: A Library of Tools for Solving Production Planning Problems.- From Spheres to Spheropolyhedra: Generalized Distinct Element Methodology and Algorithm Analysis.- Graphic Submodular Function Minimization: A Graphic Approach and Applications.- Matroidsthe Engineers' Revenge.- On the Relative Complexity of 15 Problems Related to 0/1-Integer Programming.- Single-Sink Multicommodity Flow with Side Constraints.- An Introduction to Network Flows over Time.- Edge-Connectivity Augmentations of Graphs and Hypergraphs.- Some Problems on Approximate Counting in Graphs and Matroids.

#	Onlineshop	Preis CHF	Versand CHF	Total CHF
1	Seller	0.00	0.00	0.00