Approximation and fixed-parameter algorithms for consecutive ones submatrix problems

Approximation and fixed-parameter algorithms for consecutive ones submatrix problems

We develop an algorithmically useful refinement of a forbidden submatrix characterization of 0/1-matrices fulfilling the Consecutive Ones Property (C1P). This characterization finds applications in new polynomial-time approximation algorithms and fixed-parameter tractability results for the NP-hard...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Journal of computer and system sciences 2010-05, Vol.76 (3), p.204-221
Hauptverfasser: Dom, Michael, Guo, Jiong, Niedermeier, Rolf
Format: Artikel
Sprache:eng
Schlagworte:
Algorithms
Approximation
Circular ones property
Consecutive ones property
Exact algorithms
Fixed-parameter tractability
Forbidden submatrix characterization
Mathematical analysis
NP-hard problem
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:We develop an algorithmically useful refinement of a forbidden submatrix characterization of 0/1-matrices fulfilling the Consecutive Ones Property (C1P). This characterization finds applications in new polynomial-time approximation algorithms and fixed-parameter tractability results for the NP-hard problem to delete a minimum number of rows or columns from a 0/1-matrix such that the remaining submatrix has the C1P.
ISSN:0022-0000
1090-2724
DOI:10.1016/j.jcss.2009.07.001