[Lecture Notes in Computer Science] LATIN'98: Theoretical Informatics Volume 1380 || Spectral techniques in graph algorithms
- 作者Lucchesi, Cláudio L.; Moura, Arnaldo V.
- 文件大小624.78KB
- 发表时间1998
- DOI10.1007/bfb0054322
- 页码206-215
[Lecture Notes in Computer Science] Lectures on Proof Verification and Approximation Algorithms Volume 1367 || DerandomizationMayr, Ernst W.; Jürgen Prömel, Hans; Steger, Angelika · 1998
[Lecture Notes in Computer Science] Lectures on Proof Verification and Approximation Algorithms Volume 1367 || Introduction to randomized algorithmsMayr, Ernst W.; Jürgen Prömel, Hans; Steger, Angelika · 1998
[Lecture Notes in Computer Science] Lectures on Proof Verification and Approximation Algorithms Volume 1367 || Proving the PCP-TheoremMayr, Ernst W.; Jürgen Prömel, Hans; Steger, Angelika · 1998
[Lecture Notes in Computer Science] Lectures on Proof Verification and Approximation Algorithms Volume 1367 || Dense instances of hard optimization problemsMayr, Ernst W.; Jürgen Prömel, Hans; Steger, Angelika · 1998
[Lecture Notes in Computer Science] Lectures on Proof Verification and Approximation Algorithms Volume 1367 || Proof checking and non-approximabilityMayr, Ernst W.; Jürgen Prömel, Hans; Steger, Angelika · 1998
[Lecture Notes in Computer Science] Lectures on Proof Verification and Approximation Algorithms Volume 1367 || Parallel repetition of MIP(2,1) systemsMayr, Ernst W.; Jürgen Prömel, Hans; Steger, Angelika · 1998
[Lecture Notes in Computer Science] Lectures on Proof Verification and Approximation Algorithms Volume 1367 || Optimal non-approximability of MaxCliqueMayr, Ernst W.; Jürgen Prömel, Hans; Steger, Angelika · 1998