The Parameterized Complexity of Some Geometric Problems in Unbounded Dimension

DOI10.1007/978-3-642-11269-0_16zbMath1273.68170arXiv0906.3469OpenAlexW1777044164MaRDI QIDQ3656862

Panos Giannopoulos, Christian Knauer, Günter Rote

Publication date: 14 January 2010

Published in: Parameterized and Exact Computation (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/0906.3469

zbMATH Keywords

lower boundsparameterized complexitymaximum feasible subsystemgeometric dimensionminimum enclosing cylinder2-linear separability

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items (2)

Robust fitting in computer vision: easy or hard? ⋮ Fixed-parameter complexity and approximability of norm maximization

This page was built for publication: The Parameterized Complexity of Some Geometric Problems in Unbounded Dimension