Searching for authors named "Iannis Tourlakis" – sorted by Relevance.
-
New lower bounds for Approximation Algorithms in the Lovasz-Schrijver Hierarchy
- Determining how well we can efficiently compute approximate solutions to NPhard problems is of great theoretical and practical interest. Typically the famous PCP theorem is used for showing that a problem has no algorithms computing good approximations. Unfortunately, for many problem this approach
- Cited by 1 (0 self) – Add To MetaCart
-
Towards strong nonapproximability results in the Lovasz-Schrijver hierarchy
- hierarchy
- Cited by 10 (1 self) – Add To MetaCart

