Exponential inapproximability of selecting a maximum volume sub-matrix

Algorithmica

Volumn 65, Issue 1, 2013, Pages 159-176

  Çivril, Ali ^a   Magdon Ismail, Malik ^b  

^a MELIKSAH UNIVERSITY   (Turkey)

^b RENSSELAER POLYTECHNIC INSTITUTE   (United States)

Author keywords

Complexity; Inapproximability; Matrices; Volume

Indexed keywords

COLUMN VECTOR; COMPLEXITY; EXPONENTIAL INAPPROXIMABILITY; INAPPROXIMABILITY; POSITIVE INTEGERS; VOLUME;

MATRIX ALGEBRA;

EID: 84872617323     PISSN: 01784617     EISSN: 14320541     Source Type: Journal    
DOI: 10.1007/s00453-011-9582-6     Document Type: Article

References (26)

1. Arora, S., Lund, C., Motwani, R., Sudan, M., Szegedy, M.: Proof verification and the hardness of approximation problems. J. ACM 45(3), 501-555 (1998) (Pubitemid 128506634)
2. Arora, S., Safra, S.: Probabilistic checking of proofs: a new characterization of NP. J. ACM 45(1), 70-122 (1998) (Pubitemid 128615465)
3. Boutsidis, C., Drineas, P., Magdon-Ismail, M.: Near-optimal column based matrix reconstruction. (2011). arXiv:1103.0995v1
4. Boutsidis, C., Mahoney, M.W., Drineas, P.: An improved approximation algorithm for the column subset selection problem. In: SODA'09: Proceedings of the 19th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 968-977 (2009)
5. Chan, T.F.: Rank revealing QR factorizations. Linear Algebra Appl. 88/89, 67-82 (1987)
6. Chan, T.F., Hansen, P.: Low-rank revealing QR factorizations. Numer. Linear Algebra Appl. 1, 33-44 (1994)
7. Chandrasekaran, S., Ipsen, I.C.F.: On rank-revealing factorizations. SIAM J. Matrix Anal. Appl. 15, 592-622 (1994)
8. Çivril, A., Magdon-Ismail, M.: On selecting a maximum volume sub-matrix of a matrix and related problems. Theor. Comput. Sci. 410(47-49), 4801-4811 (2009)
9. de Hoog, F.R., Mattheijb, R.M.M.: Subset selection for matrices. Linear Algebra Appl. 422, 349-359 (2007) (Pubitemid 46329667)
10. Deshpande, A., Rademacher, L.: Efficient volume sampling for row/column subset selection. In: FOCS'10: Proceedings of 51st Annual Symposium on Foundations of Computer Science, pp. 329-338 (2010)
11. Deshpande, A., Rademacher, L., Vempala, S., Wang, G.: Matrix approximation and projective clustering via volume sampling. Theory Comput. 2(1), 225-247 (2006)
12. Deshpande, A., Vempala, S.: Adaptive sampling and fast low-rank matrix approximation. In: RANDOM'06: 10th International Workshop on Randomization and Computation, pp. 292-303 (2006) (Pubitemid 44577539)
13. Feige, U.: A threshold of lnn for approximating set cover. J. ACM 45(4), 634-652 (1998) (Pubitemid 128488790)
14. Golub, G.H., Klema, V., Stewart, G.W.: Rank degeneracy and least squares problems. Technical report, Dept. of Computer Science, Univ. of Maryland, 1976
15. Golub, G.H., Loan, C.V.: Matrix Computations. Johns Hopkins University Press, Baltimore (1996)
16. Goreinov, S.A., Tyrtyshnikov, E.E.: The maximal-volume concept in approximation by low-rank matrices. In: Contemporary Mathematics, vol. 280, pp. 47-51. AMS, Providence (2001)
17. Goreinov, S.A., Zamarashkin, N.L., Tyrtyshnikov, E.E.: Pseudo-skeleton approximations by matrices of maximal volume. Mat. Zametki 62, 619-623 (1997)
18. Gritzmann, P., Klee, V., Larman, D.G.: Largest j-simplices n-polytopes. Discrete Comput. Geom. 13, 477-515 (1995)
19. Gu, M., Eisenstat, S.C.: Efficient algorithms for computing a strong rank-revealing QR factorization. SIAM J. Sci. Comput. 17(4), 848-869 (1996) (Pubitemid 126621180)
20. Hazan, E., Safra, S., Schwartz, O.: On the complexity of approximating k-set packing. Comput. Complex. 15, 20-39 (2006) (Pubitemid 43706824)
21. Hong, Y.P., Pan, C.T.: Rank-revealing QR factorizations and the singular value decomposition. Math. Comput. 58, 213-232 (1992)
22. Koutis, I.: Parameterized complexity and improved inapproximability for computing the largest j-simplex in a V-polytope. Inf. Process. Lett. 100, 8-13 (2006) (Pubitemid 43975099)
23. Packer, A.: Polynomial-time approximation of largest simplices in V-polytopes. Discrete Appl. Math. 134, 213-237 (2004)
24. Pan, C.T.: On the existence and computation of rank-revealing LU factorizations. Linear Algebra Appl. 316(1-3), 199-222 (2000)
25. Pan, C.T., Tang, P.T.P.: Bounds on singular values revealed by QR factorizations. BIT Numer. Math. 39, 740-756 (1999)
26. Raz, R.: A parallel repetition theorem. SIAM J. Comput. 27(3), 763-803 (1998) (Pubitemid 128490838)