Exponential Inapproximability of Selecting a Maximum Volume Sub-matrix

Details Exponential Inapproximability of Selecting a Maximum Volume Sub-matrix Exponential Inapproximability of Selecting a Maximum Volume Sub-matrix

2010-06-22

arxiv.org/abs/1006.4349v4

Computer Science

Computational Complexity

14 pages, 2 figures

Scientific paper

Given a matrix $A \in \mathbb{R}^{m \times n}$ ($n$ vectors in $m$ dimensions), and a positive integer $k < n$, we consider the problem of selecting $k$ column vectors from $A$ such that the volume of the parallelepiped they define is maximum over all possible choices. We prove that there exists $\delta<1$ and $c>0$ such that this problem is not approximable within $2^{-ck}$ for $k = \delta n$, unless $P=NP$.

Affiliated with

Also associated with

No associations

Rating

Exponential Inapproximability of Selecting a Maximum Volume Sub-matrix 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 Exponential Inapproximability of Selecting a Maximum Volume Sub-matrix, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Exponential Inapproximability of Selecting a Maximum Volume Sub-matrix will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-108695