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

DOI10.1016/j.ipl.2006.05.006zbMath1185.68782MaRDI 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

zbMATH Keywords

computational complexity; computational geometry; inapproximability; parameterized computation

Mathematics Subject Classification ID

68U05: Computer graphics; computational geometry (digital and algorithmic aspects)

68W25: Approximation algorithms

Related Items

Exponential inapproximability of selecting a maximum volume sub-matrix, Column subset selection problem is UG-hard

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Polynomial-time approximation of largest simplices in \(V\)-polytopes.
• Oracle-polynomial-time approximation of largest simplices in convex bodies
• \(\mathbb N\mathbb P\)-hardness of largest contained and smallest containing simplices for \(V\)- and \(H\)-polytopes
• Geometric optimization problems likely not contained in \(\mathbb A\mathbb P\mathbb X\)
• Largest \(j\)-simplices in \(n\)-polytopes
• Matrix Analysis
• Matrices and graphs in Euclidean geometry
• Approximation, Randomization, and Combinatorial Optimization.. Algorithms and Techniques