http://www.loc.gov/mods/v3 http://www.loc.gov/standards/mods/v3/mods-3-2.xsd
Lectures on proof verification and approximation algorithms
1 online resource (xii, 344 pages) : illustrations
Introduction to the theory of complexity and approximation algorithms / Thomas Jansen -- Introduction to randomized algorithms / Artur Andrzejak -- Derandomization / Detlef Sieling -- Proof checking and non-approximability / Stefan Hougardy -- Proving the PCP-theorem / Volker Heun, Wolfgang Merkle, Ulrich Weigand -- Parallel repetition of MIP(2,1) systems / Clemens Gröpl, Martin Skutella -- Bounds for approximating MAXLINEQ3-2 and MAXEkSAT / Sebastian Seibert, Thomas Wilke -- Deriving non-approximability results by reductions / Claus Rick, Hein Röhrig -- Optimal non-approximability of MAXCLIQUE / Martin Mundhenk, Anna Slobodová -- The hardness of approximating set cover / Alexander Wolff -- Semidefinite programming and its applications to approximation algorithms / Thomas Hofmeister, Martin Hühne -- Dense instances of hard optimization problems / Katja Wolf -- Polynomial time approximation schemes for geometric optimization problems in Euclidean metric spaces / Richard Mayr, Annette Schelten.
Ernst W. Mayr, Hans Jürgen Prömel, Angelika Steger (eds.).
Includes bibliographical references (pages 325-334) and indexes.
Lecture notes in computer science ; 1367