Tools

LEADER 02565cam a2200433 a 4500

001 ocm38478582;

003 OCoLC;

005 20141212130512.0;

008 980213s1998 gw a b 001 0 eng ;

010 a| 98014448;

015 a| GB98-26041;

019 a| 39002690;

020 a| 3540642013 (Berlin : alk. paper);

035 a| (Sirsi) o38478582;

035 a| (OCoLC)38478582;

049 a| EREE;

050 00 a| QA76.9.A96b| L43 1998;

082 00 a| 005.1/42| 21;

245 00 a| Lectures on proof verification and approximation algorithms /c| Ernst W. Mayr, Hans Jürgen Prömel, Angelika Steger (eds.).;

300 a| xii, 344 pages :b| illustrations ;c| 24 cm.;

336 a| text2| rdacontent;

337 a| unmediated2| rdamedia;

338 a| volume2| rdacarrier;

490 1 a| Lecture notes in computer science ;v| 1367;

504 a| Includes bibliographical references (p. [325]-334) and indexes.;

505 0 a| 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.;

650 0 a| Automatic theorem proving.=| ^A88007;

650 0 a| Computer algorithms.=| ^A285321;

650 0 a| Approximation theory.=| ^A16000;

700 1 a| Mayr, Ernst.=| ^A352266;

700 1 a| Prömel, H. J.=| ^A406300;

700 1 a| Steger, Angelika.=| ^A406301;

830 0 a| Lecture notes in computer sciencev| 1367.=| ^A466336;

994 a| E0b| ERE;

596 a| 1;

998 a| 640152;

999 a| QA76.9.A96 L43 1998w| LCc| 1i| 30372010220827d| 3/6/2013f| 3/6/2013g| 1l| JGESm| JOYNERr| Ys| Yt| JGESBKu| 8/27/1999x| BOOKz| JSTACKSo| .STAFF. 0;

Lectures on proof verification and approximation algorithms / Ernst W. Mayr, Hans Jürgen Prömel, Angelika Steger (eds.).

Other author	Mayr, Ernst.
Other author	Prömel, H. J.
Other author	Steger, Angelika.
Format	Book
Publication Info	Berlin ; New York : Springer, ©1998.
Description	xii, 344 pages : illustrations ; 24 cm.
Subjects	Automatic theorem proving. Computer algorithms. Approximation theory.

Series	Lecture notes in computer science ; 1367 Lecture notes in computer science 1367. ^A466336
Contents	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.
Bibliography note	Includes bibliographical references (p. [325]-334) and indexes.
LCCN	98014448
ISBN	3540642013 (Berlin : alk. paper)

Availability

Library	Location	Call Number	Status	Item Actions
Joyner	General Stacks	QA76.9.A96 L43 1998	✔ Available	Place Hold

Lectures on proof verification and approximation algorithms / Ernst W. Mayr, Hans Jürgen Prömel, Angelika Steger (eds.).

Click here for more information about this title

Availability