Thomas Jansen Introduction to the Theory of Complexity and Approximation Algorithms. [Citation Graph (0, 0)][DBLP] Lectures on Proof Verification and Approximation Algorithms, 1997, pp:5-28 [Conf]
Artur Andrzejak Introduction to Randomized Algorithms. [Citation Graph (0, 0)][DBLP] Lectures on Proof Verification and Approximation Algorithms, 1997, pp:29-40 [Conf]
Detlef Sieling Derandomization. [Citation Graph (0, 0)][DBLP] Lectures on Proof Verification and Approximation Algorithms, 1997, pp:41-62 [Conf]
Stefan Hougardy Proof Checking and Non-approximability. [Citation Graph (0, 0)][DBLP] Lectures on Proof Verification and Approximation Algorithms, 1997, pp:63-82 [Conf]
Alexander Wolff The Hardness of Approximating Set Cover. [Citation Graph (0, 0)][DBLP] Lectures on Proof Verification and Approximation Algorithms, 1997, pp:249-262 [Conf]
Thomas Hofmeister, Martin Hühne Semidefinite Programming and Its Applications to Approximation Algorithms. [Citation Graph (0, 0)][DBLP] Lectures on Proof Verification and Approximation Algorithms, 1997, pp:263-298 [Conf]
Katja Wolf Dense Instances of Hard Optimization Problems. [Citation Graph (0, 0)][DBLP] Lectures on Proof Verification and Approximation Algorithms, 1997, pp:299-312 [Conf]
Richard Mayr, Annette Schelten Polynomial Time Approximation Schemes for Geometric Optimization Problems in Euclidean Metric Spaces. [Citation Graph (0, 0)][DBLP] Lectures on Proof Verification and Approximation Algorithms, 1997, pp:313-324 [Conf]
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
