Parameterized complexity and improved inapproximability for computing the largest \(j\)-simplex in a \(V\)-polytope (Q845815)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5664683
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Parameterized complexity and improved inapproximability for computing the largest \(j\)-simplex in a \(V\)-polytope |
scientific article; zbMATH DE number 5664683 |
Statements
Parameterized complexity and improved inapproximability for computing the largest \(j\)-simplex in a \(V\)-polytope (English)
0 references
29 January 2010
0 references
computational complexity
0 references
computational geometry
0 references
inapproximability
0 references
parameterized computation
0 references
0 references
0 references
0.8947916030883789
0 references
0.838551938533783
0 references
0.838551938533783
0 references
0.8252071738243103
0 references
