Approximation algorithms for the consecutive ones submatrix problem on sparse matrices
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Saved in:
Main Authors: | Tan, J., Zhang, L. |
---|---|
Other Authors: | MATHEMATICS |
Format: | Article |
Published: |
2014
|
Online Access: | http://scholarbank.nus.edu.sg/handle/10635/102875 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | National University of Singapore |
Similar Items
-
The consecutive ones submatrix problem for sparse matrices
by: Tan, J., et al.
Published: (2014) -
The inverse eigenproblem of centrosymmetric matrices with a submatrix constraint and its approximation
by: Bai, Z.-J.
Published: (2016) -
Improving the discrepancy bound for sparse matrices: Better approximations for sparse lattice approximation problems
by: Srinivasan, Aravind
Published: (2014) -
Optimized GPU algorithms for sparse data problems
by: Pham, Nguyen Quang Anh
Published: (2017) -
On the hardness of approximating the permanent of structured matrices
by: Codenotti, B., et al.
Published: (2016)