Lectures on Proof Verification and Approximation Algorithms. (the book grow out of a Dagstuhl Seminar, April 21-25, 1997)

Authors:
Ernst W. Mayr;Hans Jürgen Prömel;Angelika Steger
Affiliations:
-;-;-
Venue:
Lectures on Proof Verification and Approximation Algorithms. (the book grow out of a Dagstuhl Seminar, April 21-25, 1997)
Year:
1998

Citing 0
Cited 1

When crossings count — approximating the minimum spanning tree

Proceedings of the sixteenth annual symposium on Computational geometry

Quantified Score

Hi-index	0.00

Visualization

Abstract

From the Publisher:This is a self-contained presentation of the enormous recent progress on the interplay between and applications of the theory of probabilistically checkable proofs and approximation algorithms.