Login / Signup
Parameterized complexity and improved inapproximability for computing the largest j-simplex in a V-polytope.
Ioannis Koutis
Published in:
Inf. Process. Lett. (2006)
Keyphrases
</>
parameterized complexity
knapsack problem
database
directed graph
approximation algorithms
global constraints