The Parameterized Complexity of Some Geometric Problems in Unbounded Dimension
نویسندگان
چکیده
We study the parameterized complexity of the following fundamental geometric problems with respect to the dimension d: i) Given n points in Rd, compute their minimum enclosing cylinder. ii) Given two n-point sets in Rd, decide whether they can be separated by two hyperplanes. iii) Given a system of n linear inequalities with d variables, find a maximum-size feasible subsystem. We show that (the decision versions of) all these problems are W[1]-hard when parameterized by the dimension d. Our reductions also give a nΩ(d)-time lower bound (under the Exponential Time Hypothesis).
منابع مشابه
Bounded Fixed-Parameter Tractability and log2n Nondeterministic Bits
Motivated by recent results showing that there are natural parameterized problems that are fixed-parameter tractable, but can only be solved by fixed-parameter tractable algorithms the running time of which depends non-elementarily on the parameter, we propose a notion of bounded fixed-parameter tractability, where the dependence of the running time on the parameter is restricted to be singly e...
متن کاملOn the Complexity of Some Geometric Problems in Unbounded Dimension
This paper examines the complexity of several geometric problems due to un bounded dimension The problems considered are i minimum cover of points by unit cubes ii minimum cover of points by unit balls and iii minimum number of lines to hit a set of balls Each of these problems is proven not to have a poly nomial approximation scheme unless P NP Speci c lower bounds on the error ratios attainab...
متن کاملParameterized Complexity and Subexponential Time
Parameterized Complexity in its origins was considered by many researchers to be an exotic research eld, orthogonal to the standard way of classifying problems in complexity theory. In the last years however many surprising connections between Parameterized Complexity and classical areas in complexity theory have been established. Jörg Flum and Martin Grohe survey in this column some of these i...
متن کاملSome Lower Bounds in Parameterized AC^0
We demonstrate some lower bounds for parameterized problems via parameterized classes corresponding to the classical AC0. Among others, we derive such a lower bound for all fptapproximations of the parameterized clique problem and for a parameterized halting problem, which recently turned out to link problems of computational complexity, descriptive complexity, and proof theory. To show the fir...
متن کاملParameterized Complexity of Geometric Problems
This paper surveys parameterized complexity results for NP-hard geometric problems. Geometric problems arise frequently in application domains as diverse as computer graphics [19], computer vision [4, 35, 43], VLSI design [64], geographic information systems [73, 30], graph drawing [72], and robotics [65, 37], and typically involve (sets of) geometric objects, such as, points, line segments, ba...
متن کامل