Approximation and fixed-parameter algorithms for consecutive ones submatrix problems

Journal of Computer and System Sciences

Volumn 76, Issue 3-4, 2010, Pages 204-221

  Dom, Michael ^a   Guo, Jiong ^a   Niedermeier, Rolf ^a  

^a FRIEDRICH SCHILLER UNIVERSITY JENA   (Germany)

Author keywords

Circular ones property; Consecutive ones property; Exact algorithms; Fixed parameter tractability; Forbidden submatrix characterization; NP hard problem

Indexed keywords

APPROXIMATION ALGORITHMS; COMPUTATIONAL COMPLEXITY; NP-HARD; POLYNOMIAL APPROXIMATION;

CIRCULAR ONES PROPERTY; CONSECUTIVE ONES PROPERTY; EXACT ALGORITHMS; FIXED-PARAMETER TRACTABILITY; SUBMATRIX;

PARAMETER ESTIMATION;

EID: 77950342085     PISSN: 00220000     EISSN: 10902724     Source Type: Journal    
DOI: 10.1016/j.jcss.2009.07.001     Document Type: Article

References (47)

1. Althaus E., Canzar S., Emmett M.R., Karrenbauer A., Marshall A.G., Meyer-Baese A., and Zhang H. Computing H/D-exchange speeds of single residues from data of peptic fragments. Proceedings of the 23rd ACM Symposium on Applied Computing. SAC '08 (2008), ACM Press 1273-1277
2. Atkins J.E., Boman E.G., and Hendrickson B. A spectral algorithm for seriation and the consecutive ones problem. SIAM J. Comput. 28 1 (1998) 297-310
3. Atkins J.E., and Middendorf M. On physical mapping and the consecutive ones property for sparse matrices. Discrete Appl. Math. 71 1-3 (1996) 23-40
4. Ausiello G., Crescenzi P., Gambosi G., Kann V., Marchetti-Spaccamela A., and Protasi M. Complexity and Approximation: Combinatorial Optimization Problems and Their Approximability Properties (1999), Springer
5. Bartholdi III J.J., Orlin J.B., and Ratliff H.D. Cyclic scheduling via integer programs with circular ones. Oper. Res. 28 5 (1980) 1074-1085
6. Booth K.S., and Lueker G.S. Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms. J. Comput. System Sci. 13 (1976) 335-379
7. Christof T., Oswald M., and Reinelt G. Consecutive ones and a betweenness problem in computational biology. Proceedings of the 6th International Conference on Integer Programming and Combinatorial Optimization. IPCO '98. Lecture Notes in Comput. Sci. vol. 1412 (1998), Springer 213-228
8. Dom M. Recognition Generation, and Application of Binary Matrices with the Consecutive-ones Property. PhD thesis, Institut für Informatik, Friedrich-Schiller-Universität Jena, Germany, 2008, published by (2009), Cuvillier
9. Dom M. Algorithmic aspects of the consecutive-ones property. Bull. Eur. Assoc. Theor. Comput. Sci. EATCS 98 (2009) 27-59
10. Dom M., Guo J., and Niedermeier R. Approximability and parameterized complexity of consecutive ones submatrix problems. Proceedings of the 4th Annual Conference on Theory and Applications of Models of Computation. TAMC '07. Lecture Notes in Comput. Sci. vol. 4484 (2007), Springer 680-691
11. Dom M., and Niedermeier R. The search for consecutive ones submatrices: Faster and more general. Proceedings of the 3rd Workshop Algorithms and Complexity in Durham. ACiD '07. Texts Algorithmics vol. 9 (2007), College Publications 43-54
12. Downey R.G., and Fellows M.R. Parameterized Complexity (1999), Springer
13. Dujmovic V., Fellows M.R., Hallett M.T., Kitching M., Liotta G., McCartin C., Nishimura N., Ragde P., Rosamond F.A., Suderman M., Whitesides S., and Wood D.R. A fixed-parameter approach to 2-Layer Planarization. Algorithmica 45 2 (2006) 159-182
14. Fernau H. Two-layer planarization: Improving on parameterized algorithmics. Proceedings of the 31st Conference on Current Trends in Theory and Practice of Informatics. SOFSEM '05. Lecture Notes in Comput. Sci. vol. 3381 (2005), Springer 137-146
15. Fernau H. Parameterized algorithmics for linear arrangement problems. Discrete Appl. Math. 156 17 (2008) 3166-3177
16. Flum J., and Grohe M. Parameterized Complexity Theory (2006), Springer
17. Fulkerson D.R., and Gross O.A. Incidence matrices and interval graphs. Pacific J. Math. 15 3 (1965) 835-855
18. Garey M.R., and Johnson D.S. Computers and Intractability: A Guide to the Theory of NP-Completeness (1979), Freeman
19. Guo J., and Niedermeier R. Invitation to data reduction and problem kernelization. ACM SIGACT News 38 1 (2007) 31-45
20. Habib M., McConnell R.M., Paul C., and Viennot L. Lex-BFS and partition refinement, with applications to transitive orientation, interval graph recognition and consecutive ones testing. Theoret. Comput. Sci. 234 1-2 (2000) 59-84
21. M. Hajiaghayi, Consecutive ones property, Manuscript, School of Computer Science, University of Waterloo, Canada, 2000
22. Hajiaghayi M., and Ganjali Y. A note on the consecutive ones submatrix problem. Inform. Process. Lett. 83 3 (2002) 163-166
23. Hassin R., and Megiddo N. Approximation algorithms for hitting objects with straight lines. Discrete Appl. Math. 30 (1991) 29-42
24. Hochbaum D.S., and Levin A. Cyclical scheduling and multi-shift scheduling: Complexity and approximation algorithms. Discrete Optim. 3 4 (2006) 327-340
25. Hsu W.-L. A simple test for the consecutive ones property. J. Algorithms 43 1 (2002) 1-16
26. Hsu W.-L., and McConnell R.M. PC trees and circular-ones arrangements. Theoret. Comput. Sci. 296 1 (2003) 99-116
27. Khot S., and Regev O. Vertex cover might be hard to approximate to within 2 - ε{lunate}. J. Comput. System Sci. 74 3 (2008) 335-349
28. Köhler E. Recognizing graphs without asteroidal triples. J. Discrete Algorithms 2 4 (2004) 439-452
29. Korte N., and Möhring R.H. An incremental linear-time algorithm for recognizing interval graphs. SIAM J. Comput. 18 1 (1989) 68-81
30. Kou L.T. Polynomial complete consecutive information retrieval problems. SIAM J. Comput. 6 1 (1977) 67-75
31. Kratsch D., McConnell R.M., Mehlhorn K., and Spinrad J. Certifying algorithms for recognizing interval graphs and permutation graphs. SIAM J. Comput. 36 2 (2006) 326-353
32. McConnell R.M. A certifying algorithm for the consecutive-ones property. Proceedings of the 15th Annual ACM-SIAM Symposium on Discrete Algorithms. SODA '04 (2004), ACM Press 768-777
33. Mecke S., Schöbel A., and Wagner D. Station location - complexity and approximation. Proceedings of the 5th Workshop on Algorithmic Methods and Models for Optimization of Railways. ATMOS '05 (2005), IBFI Dagstuhl, Germany
34. Mecke S., and Wagner D. Solving geometric covering problems by data reduction. Proceedings of the 12th Annual European Symposium on Algorithms. ESA '04. Lecture Notes in Comput. Sci. vol. 3221 (2004), Springer 760-771
35. Meidanis J., Porto O., and Telles G.P. On the consecutive ones property. Discrete Appl. Math. 88 (1998) 325-354
36. Niedermeier R. Invitation to Fixed-Parameter Algorithms (2006), Oxford University Press
37. Oswald M., and Reinelt G. The weighted consecutive ones problem for a fixed number of rows or columns. Oper. Res. Lett. 31 3 (2003) 350-356
38. Oswald M., and Reinelt G. The simultaneous consecutive ones problem. Theoret. Comput. Sci. 410 21-23 (2009) 1986-1992
39. Ruf N., and Schöbel A. Set covering with almost consecutive ones property. Discrete Optim. 1 2 (2004) 215-228
40. M. Suderman, Layered graph drawing, PhD thesis, School of Computer Science, McGill University Montréal, Canada, 2005
41. Suderman M., and Whitesides S. Experiments with the fixed-parameter approach for two-layer planarization. Proceedings of the 11th International Symposium on Graph Drawing. GD '03. Lecture Notes in Comput. Sci. vol. 2912 (2003), Springer 345-356
42. Tan J., and Zhang L. The consecutive ones submatrix problem for sparse matrices. Algorithmica 48 3 (2007) 287-299
43. Tucker A.C. Matrix characterizations of circular-arc graphs. Pacific J. Math. 2 39 (1971) 535-545
44. Tucker A.C. A structure theorem for the consecutive 1's property. J. Combin. Theory Ser. B 12 (1972) 153-162
45. Vazirani V.V. Approximation Algorithms (2001), Springer
46. Veinott A.F., and Wagner H.M. Optimal capacity scheduling. Oper. Res. 10 (1962) 518-547
47. Veldhorst M. Approximation of the consecutive ones matrix augmentation problem. SIAM J. Comput. 14 3 (1985) 709-729