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

DOI10.1016/J.IPL.2006.05.006MaRDI QIDQ845815zbMATH OpenOpenAlexFDO

Authors 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 complexitycomputational geometryinapproximabilityparameterized computation

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Approximation algorithms (68W25)

Recommendations

• Polynomial-time approximation of largest simplices in \(V\)-polytopes.
• Largest \(j\)-simplices in \(n\)-polytopes
• Computational complexity of inner and outer \(j\)-radii of polytopes in finite-dimensional normed spaces
• On largest volume simplices and sub-determinants
• \(\mathbb N\mathbb P\)-hardness of largest contained and smallest containing simplices for \(V\)- and \(H\)-polytopes

Cites work

• scientific article; zbMATH DE number 3141674 (Why is no real title available?)
• scientific article; zbMATH DE number 47363 (Why is no real title available?)
• scientific article; zbMATH DE number 194139 (Why is no real title available?)
• scientific article; zbMATH DE number 1161563 (Why is no real title available?)
• scientific article; zbMATH DE number 3331438 (Why is no real title available?)
• Geometric optimization problems likely not contained in \(\mathbb A\mathbb P\mathbb X\)
• Largest \(j\)-simplices in \(n\)-polytopes
• Matrices and graphs in Euclidean geometry
• Matrix Analysis
• On the complexity of approximating \(k\)-dimensional matching
• Oracle-polynomial-time approximation of largest simplices in convex bodies
• Polynomial-time approximation of largest simplices in \(V\)-polytopes.
• \(\mathbb N\mathbb P\)-hardness of largest contained and smallest containing simplices for \(V\)- and \(H\)-polytopes

Cited in

(9)

• Randomized rounding for the largest simplex problem
• Column subset selection problem is UG-hard
• On the parameterized intractability of determinant maximization
• FPT-algorithm for computing the width of a simplex given by a convex hull
• Largest \(j\)-simplices in \(n\)-polytopes
• Exponential inapproximability of selecting a maximum volume sub-matrix
• Polynomial-time approximation of largest simplices in \(V\)-polytopes.
• Some Inapproximability Results of MAP Inference and Exponentiated Determinantal Point Processes
• \(\mathbb N\mathbb P\)-hardness of largest contained and smallest containing simplices for \(V\)- and \(H\)-polytopes

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q845815)