Search results for "semidefinite programming based approximation algorithms"

Searching for phrase semidefinite programming based approximation algorithms (changed automatically) with no syntactic query expansion in all metadata.

Found 6 publication records. Showing 6 according to the selection in the facets

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
2	Noga Alon, Benny Sudakov, Uri Zwick	Constructing worst case instances for semidefinite programming based approximation algorithms.	SODA	2001	DBLP DOI BibTeX RDF
2	Sanjeev Mahajan, Ramesh Hariharan	Derandomizing Semidefinite Programming Based Approximation Algorithms.	FOCS	1995	DBLP DOI BibTeX RDF	semidefinite programming based approximation algorithms, Max k-Cut, Max-Dicut, Max-Bisection, k Vertex Coloring, polynomial time randomized algorithms, polynomial time deterministic algorithms, computational complexity, randomized algorithms, semidefinite programming, programming theory, NP-Complete problems, deterministic algorithms, Independent Set, randomised algorithms, Max-Cut, Max-Sat
1	Uri Zwick	Computer assisted proof of optimal approximability results.	SODA	2002	DBLP DOI BibTeX RDF
1	Noga Alon, Benny Sudakov, Uri Zwick	Constructing Worst Case Instances for Semidefinite Programming Based Approximation Algorithms.	SIAM J. Discrete Math.	2001	DBLP DOI BibTeX RDF
1	Uri Zwick	Semidefinite Programming Based Approximation Algorithms.	FSTTCS	2001	DBLP DOI BibTeX RDF
1	Eran Halperin, Uri Zwick	A Unified Framework for Obtaining Improved Approximation Algorithms for Maximum Graph Bisection Problems.	IPCO	2001	DBLP DOI BibTeX RDF

Displaying result #1 - #6 of 6 (100 per page; Change: )

Maintained by Jörg Diederich.

Based upon DBLP by Michael Ley.