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

From MaRDI portal
Publication:845815

DOI10.1016/j.ipl.2006.05.006zbMath1185.68782OpenAlexW2024426511MaRDI QIDQ845815

Ioannis Koutis

Publication date: 29 January 2010

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2006.05.006




Related Items (3)



Cites Work


This page was built for publication: Parameterized complexity and improved inapproximability for computing the largest \(j\)-simplex in a \(V\)-polytope