Approximation Algorithms and Semidefinite Programming [Gärtner & Matoušek 2012-01-13].pdf

(3535 KB) Pobierz
Approximation Algorithms and Semidefinite
Programming
Bernd G¨ rtner
a
Jiˇ´ Matouˇek
s
Approximation Algorithms
and Semidefinite
Programming
123
Bernd G¨ rtner
a
ETH Zurich
Institute of Theoretical Computer Science
8092 Zurich
Switzerland
gaertner@inf.ethz.ch
Jiˇ´ Matouˇek
s
Charles University
Department of Applied Mathematics
Malostransk´ n´ m. 25
e a
118 00 Prague 1
Czech Republic
matousek@kam.mff.cuni.cz
ISBN 978-3-642-22014-2
e-ISBN 978-3-642-22015-9
DOI 10.1007/978-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 (www.springer.com)
Zgłoś jeśli naruszono regulamin