Combinatorial Optimization_ Theory and Algorithms (4th ed.) [Korte & Vygen 2007-11-29].pdf

(7253 KB) Pobierz
Algorithms and Combinatorics
Volume 21
Editorial Board
R. L. Graham, La Jolla
B. Korte, Bonn
L. Lovász, Budapest
A. Wigderson, Princeton
G. M. Ziegler, Berlin
Bernhard Korte · Jens Vygen
Combinatorial
Optimization
Theory and Algorithms
Fourth Edition
123
Bernhard Korte
Jens Vygen
Research Institute for Discrete Mathematics
University of Bonn
Lennéstraße 2
53113 Bonn
Germany
dm@or.uni-bonn.de
vygen@or.uni-bonn.de
ISBN 978-3-540-71843-7
DOI 10.1007/978-3-540-71844-4
e-ISBN 978-3-540-71844-4
Algorithms and Combinatorics ISSN 0937-5511
Library of Congress Control Number: 2007936375
Mathematics Subject Classification (2000): 90C27, 68R10, 05C85, 68Q25
© 2008 Springer-Verlag Berlin Heidelberg
This work is subject to copyright. All rights are reserved, whether the whole or part of the material is
concerned, specifically the rights of translation, reprinting, reuse of illustrations, recitation, broadcasting,
reproduction on microfilm or in any other way, and storage in data banks. Duplication of this publication
or parts thereof is permitted only under the provisions of the German Copyright Law of September 9,
1965, in its current version, and permission for use must always be obtained from Springer. Violations
are liable to prosecution under the German Copyright Law.
The use of general descriptive names, registered names, trademarks, 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.
Typesetting:
by the authors using a Springer TEX macro package
Production:
LE-TEX Jelonek, Schmidt & Vöckler GbR, Leipzig
Cover design:
WMX Design GmbH, Heidelberg
Printed on acid-free paper
987654321
springer.com
Preface to the Fourth Edition
With four English editions, and translations into four other languages forthcoming,
we are very happy with the development of our book. Again, we have revised,
updated, and significantly extended it for this fourth edition. We have added some
classical material that may have been missed so far, in particular on linear pro-
gramming, the network simplex algorithm, and the max-cut problem. We have also
added a number of new exercises and up-to-date references. We hope that these
changes serve to make our book an even better basis for teaching and research.
We gratefully acknowledge the continuous support of the Union of the Ger-
man Academies of Sciences and Humanities and the NRW Academy of Sciences
via the long-term research project “Discrete Mathematics and Its Applications”.
We also thank those who gave us feedback on the third edition, in particular
Takao Asano, Christoph Bartoschek, Bert Besser, Ulrich Brenner, Jean Fonlupt,
Satoru Fujishige, Marek Karpinski, Jens Maßberg, Denis Naddef, Sven Peyer, Klaus
Radke, Rabe von Randow, Dieter Rautenbach, Martin Skutella, Markus Struzyna,
J¨ rgen Werber, Minyi Yue, and Guochuan Zhang, for their valuable comments.
u
At
http://www.or.uni-bonn.de/∼vygen/co.html
we will continue
to maintain updated information about this book.
Bonn, August 2007
Bernhard Korte and Jens Vygen

Plik z chomika:

Inne pliki z tego folderu:

Inne foldery tego chomika:

Zgłoś jeśli naruszono regulamin