The parameterized complexity of some geometric problems in unbounded dimension

Details The parameterized complexity of some geometric problems in unbounded dimension The parameterized complexity of some geometric problems in unbounded dimension

2009-06-18

arxiv.org/abs/0906.3469v1

Computer Science

Computational Geometry

Scientific paper

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$. %and hence not solvable in ${O}(f(d)n^c)$ time, for any computable function $f$ and constant $c$ %(unless FPT=W[1]). Our reductions also give a $n^{\Omega(d)}$-time lower bound (under the Exponential Time Hypothesis).

Affiliated with

Also associated with

No associations

Rating

The parameterized complexity of some geometric problems in unbounded dimension does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with The parameterized complexity of some geometric problems in unbounded dimension, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The parameterized complexity of some geometric problems in unbounded dimension will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-725838