|
|
|
|
| LEADER |
00000nam a22000005i 4500 |
| 001 |
b3241720 |
| 003 |
MWH |
| 005 |
20191022082331.0 |
| 007 |
cr nn 008mamaa |
| 008 |
121227s1998 gw | s |||| 0|eng d |
| 020 |
|
|
|a 9783540697015
|
| 024 |
7 |
|
|a 10.1007/BFb0053010
|2 doi
|
| 035 |
|
|
|a (DE-He213)978-3-540-69701-5
|
| 050 |
|
4 |
|a E-Book
|
| 072 |
|
7 |
|a UY
|2 bicssc
|
| 072 |
|
7 |
|a COM014000
|2 bisacsh
|
| 072 |
|
7 |
|a UY
|2 thema
|
| 072 |
|
7 |
|a UYA
|2 thema
|
| 245 |
1 |
0 |
|a Lectures on Proof Verification and Approximation Algorithms
|h [electronic resource] /
|c edited by Ernst W. Mayr, Hans Jürgen Prömel, Angelika Steger.
|
| 250 |
|
|
|a 1st ed. 1998.
|
| 264 |
|
1 |
|a Berlin, Heidelberg :
|b Springer Berlin Heidelberg :
|b Imprint: Springer,
|c 1998.
|
| 300 |
|
|
|a XII, 348 p.
|b online resource.
|
| 336 |
|
|
|a text
|b txt
|2 rdacontent
|
| 337 |
|
|
|a computer
|b c
|2 rdamedia
|
| 338 |
|
|
|a online resource
|b cr
|2 rdacarrier
|
| 347 |
|
|
|a text file
|b PDF
|2 rda
|
| 490 |
1 |
|
|a Lecture Notes in Computer Science,
|x 0302-9743 ;
|v 1367
|
| 490 |
1 |
|
|a Springer eBook Collection
|
| 505 |
0 |
|
|a to the theory of complexity and approximation algorithms -- to randomized algorithms -- Derandomization -- Proof checking and non-approximability -- Proving the PCP-Theorem -- Parallel repetition of MIP(2,1) systems -- Bounds for approximating MaxLinEq3-2 and MaxEkSat -- Deriving non-approximability results by reductions -- Optimal non-approximability of MaxClique -- The hardness of approximating set cover -- Semidefinite programming and its applications to approximation algorithms -- Dense instances of hard optimization problems -- Polynomial time approximation schemes for geometric optimization problems in euclidean metric spaces.
|
| 520 |
|
|
|a During the last few years, we have seen quite spectacular progress in the area of approximation algorithms: for several fundamental optimization problems we now actually know matching upper and lower bounds for their approximability. This textbook-like tutorial is a coherent and essentially self-contained presentation of the enormous recent progress facilitated by the interplay between the theory of probabilistically checkable proofs and aproximation algorithms. The basic concepts, methods, and results are presented in a unified way to provide a smooth introduction for newcomers. These lectures are particularly useful for advanced courses or reading groups on the topic.
|
| 590 |
|
|
|a Loaded electronically.
|
| 590 |
|
|
|a Electronic access restricted to members of the Holy Cross Community.
|
| 650 |
|
0 |
|a Computers.
|
| 650 |
|
0 |
|a Algorithms.
|
| 650 |
|
0 |
|a Computer science—Mathematics.
|
| 650 |
|
0 |
|a Combinatorics.
|
| 650 |
|
0 |
|a Calculus of variations.
|
| 690 |
|
|
|a Electronic resources (E-books)
|
| 700 |
1 |
|
|a Mayr, Ernst W.
|e editor.
|4 edt
|4 http://id.loc.gov/vocabulary/relators/edt
|
| 700 |
1 |
|
|a Prömel, Hans Jürgen.
|e editor.
|4 edt
|4 http://id.loc.gov/vocabulary/relators/edt
|
| 700 |
1 |
|
|a Steger, Angelika.
|e editor.
|4 edt
|4 http://id.loc.gov/vocabulary/relators/edt
|
| 710 |
2 |
|
|a SpringerLink (Online service)
|
| 773 |
0 |
|
|t Springer eBooks
|
| 830 |
|
0 |
|a Lecture Notes in Computer Science,
|x 0302-9743 ;
|v 1367
|
| 830 |
|
0 |
|a Springer eBook Collection.
|
| 856 |
4 |
0 |
|u https://holycross.idm.oclc.org/login?auth=cas&url=https://doi.org/10.1007/BFb0053010
|3 Click to view e-book
|t 0
|
| 907 |
|
|
|a .b32417202
|b 04-18-22
|c 02-26-20
|
| 998 |
|
|
|a he
|b 02-26-20
|c m
|d @
|e -
|f eng
|g gw
|h 0
|i 1
|
| 912 |
|
|
|a ZDB-2-SCS
|
| 912 |
|
|
|a ZDB-2-LNC
|
| 912 |
|
|
|a ZDB-2-BAE
|
| 950 |
|
|
|a Computer Science (Springer-11645)
|
| 902 |
|
|
|a springer purchased ebooks
|
| 903 |
|
|
|a SEB-COLL
|
| 945 |
|
|
|f - -
|g 1
|h 0
|j - -
|k - -
|l he
|o -
|p $0.00
|q -
|r -
|s b
|t 38
|u 0
|v 0
|w 0
|x 0
|y .i21548857
|z 02-26-20
|
| 999 |
f |
f |
|i 354070fa-35cb-5e83-a111-ea3a02aa2b8f
|s fed81aed-bd86-5e9b-aaa2-8b0f24de7e4a
|t 0
|
| 952 |
f |
f |
|p Online
|a College of the Holy Cross
|b Main Campus
|c E-Resources
|d Online
|t 0
|e E-Book
|h Library of Congress classification
|i Elec File
|