Parameterized complexity and improved inapproximability for computing the largest j-simplex in a V-polytope

Ioannis Koutis. Parameterized complexity and improved inapproximability for computing the largest j-simplex in a V-polytope. Inf. Process. Lett., 100(1):8-13, 2006. [doi]

Abstract

Abstract is missing.