Approximability and parameterized complexity of consecutive ones submatrix problems (2007)
Cached
Download Links
- [theinf1.informatik.uni-jena.de]
- [theinf1.informatik.uni-jena.de]
- [www.akt.tu-berlin.de]
- DBLP
Other Repositories/Bibliography
| Venue: | IN PROC. 4TH TAMC, VOLUME 4484 OF LNCS |
| Citations: | 8 - 4 self |
BibTeX
@INPROCEEDINGS{Dom07approximabilityand,
author = {Michael Dom and Jiong Guo and Rolf Niedermeier},
title = {Approximability and parameterized complexity of consecutive ones submatrix problems},
booktitle = {IN PROC. 4TH TAMC, VOLUME 4484 OF LNCS},
year = {2007},
pages = {680--691},
publisher = {Springer}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
We develop a refinement of a forbidden submatrix characterization of 0/1-matrices fulfilling the Consecutive Ones Property (C1P). This novel characterization finds applications in new polynomial-time approximation algorithms and fixed-parameter tractability results for the problem to find a maximum-size submatrix of a 0/1-matrix such that the submatrix has the C1P. Moreover, we achieve a problem kernelization based on simple data reduction rules and provide several search tree algorithms. Finally, we derive inapproximability results.
