The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Publications at "Lectures on Proof Verification and Approximation Algorithms"( http://dblp.L3S.de/Venues/Lectures_on_Proof_Verification_and_Approximation_Algorithms )

URL (DBLP): http://dblp.uni-trier.de/db/conf/dagstuhl

Publication years (Num. hits)
1997 (13) 1998 (1)
Publication types (Num. hits)
inproceedings(13) proceedings(1)
Venues (Conferences, Journals, ...)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
No Growbag Graphs found.

Results
Found 14 publication records. Showing 14 according to the selection in the facets
Hits ? Authors Title Venue Year Link Author keywords
1Ernst W. Mayr, Hans Jürgen Prömel, Angelika Steger (eds.) Lectures on Proof Verification and Approximation Algorithms. (the book grow out of a Dagstuhl Seminar, April 21-25, 1997) Search on Bibsonomy Lectures on Proof Verification and Approximation Algorithms The full citation details ... 1998 DBLP  BibTeX  RDF
1Alexander Wolff The Hardness of Approximating Set Cover. Search on Bibsonomy Lectures on Proof Verification and Approximation Algorithms The full citation details ... 1997 DBLP  DOI  BibTeX  RDF
1Thomas Jansen Introduction to the Theory of Complexity and Approximation Algorithms. Search on Bibsonomy Lectures on Proof Verification and Approximation Algorithms The full citation details ... 1997 DBLP  DOI  BibTeX  RDF
1Volker Heun, Wolfgang Merkle, Ulrich Weigand Proving the PCP-Theorem. Search on Bibsonomy Lectures on Proof Verification and Approximation Algorithms The full citation details ... 1997 DBLP  DOI  BibTeX  RDF
1Clemens Gröpl, Martin Skutella Parallel Repetition of MIP(2, 1) Systems. Search on Bibsonomy Lectures on Proof Verification and Approximation Algorithms The full citation details ... 1997 DBLP  DOI  BibTeX  RDF
1Stefan Hougardy Proof Checking and Non-approximability. Search on Bibsonomy Lectures on Proof Verification and Approximation Algorithms The full citation details ... 1997 DBLP  DOI  BibTeX  RDF
1Claus Rick, Hein Röhrig Deriving Non-approximability Results by Reductions. Search on Bibsonomy Lectures on Proof Verification and Approximation Algorithms The full citation details ... 1997 DBLP  DOI  BibTeX  RDF
1Thomas Hofmeister, Martin Hühne Semidefinite Programming and Its Applications to Approximation Algorithms. Search on Bibsonomy Lectures on Proof Verification and Approximation Algorithms The full citation details ... 1997 DBLP  DOI  BibTeX  RDF
1Sebastian Seibert, Thomas Wilke Bounds for Approximating MAXLINEQ3-2 and MAXEKSAT. Search on Bibsonomy Lectures on Proof Verification and Approximation Algorithms The full citation details ... 1997 DBLP  DOI  BibTeX  RDF
1Katja Wolf Dense Instances of Hard Optimization Problems. Search on Bibsonomy Lectures on Proof Verification and Approximation Algorithms The full citation details ... 1997 DBLP  DOI  BibTeX  RDF
1Detlef Sieling Derandomization. Search on Bibsonomy Lectures on Proof Verification and Approximation Algorithms The full citation details ... 1997 DBLP  DOI  BibTeX  RDF
1Artur Andrzejak Introduction to Randomized Algorithms. Search on Bibsonomy Lectures on Proof Verification and Approximation Algorithms The full citation details ... 1997 DBLP  DOI  BibTeX  RDF
1Martin Mundhenk, Anna Slobodová Optimal Non-approximability of MAXCLIQUE. Search on Bibsonomy Lectures on Proof Verification and Approximation Algorithms The full citation details ... 1997 DBLP  DOI  BibTeX  RDF
1Richard Mayr, Annette Schelten Polynomial Time Approximation Schemes for Geometric Optimization Problems in Euclidean Metric Spaces. Search on Bibsonomy Lectures on Proof Verification and Approximation Algorithms The full citation details ... 1997 DBLP  DOI  BibTeX  RDF
Displaying result #1 - #14 of 14 (100 per page; Change: )
Valid XHTML 1.1! Valid CSS! [Valid RSS]
Maintained by Jörg Diederich.
Based upon DBLP by Michael Ley.