文档介绍：Bernd Gartner¨ • Jirˇ´ıMatousekˇ
Approximation Algorithms
and Semidefinite
Programming
123
Approximation Algorithms and Semidefinite
Programming
Bernd Gartner¨ Jirˇ´ıMatousekˇ
ETH Zurich Charles University
Institute of puter Science Department of Applied Mathematics
8092 Zurich Malostransken´ am.´ 25
Switzerland 118 00 Prague 1
******@ Czech Republic
******@
ISBN 978-3-642-22014-2 e-ISBN 978-3-642-22015-9
DOI -3-642-22015-9
Springer Heidelberg Dordrecht London New York
Library of Congress Control Number: 2011943166
Mathematics Subject Classification (2010): 68W25, 90C22
c Springer-Verlag Berlin Heidelberg 2012
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.
Printed on acid-free paper
Springer is part of Springer Science+Business Media ()
Preface
This text, based on a graduate course taught by the authors, introduces
the reader to selected aspects of semidefinite programming and its use in
approximation algorithms. It covers the basics as well as a significant amount
of recent and more advanced material, sometimes on the edge of current
research.
Methods based on semidefinite programming have been the big th