Approximation and fixed-parameter algorithms for consecutive ones submatrix problems (Q972381): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.jcss.2009.07.001 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2112307988 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Spectral Algorithm for Seriation and the Consecutive Ones Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Physical Mapping and the consecutive ones property for sparse matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4258216 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cyclic Scheduling via Integer Programs with Circular Ones / rank
 
Normal rank
Property / cites work
 
Property / cites work: Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3840361 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3397627 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximability and Parameterized Complexity of Consecutive Ones Submatrix Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4393480 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A fixed-parameter approach to 2-layer planarization / rank
 
Normal rank
Property / cites work
 
Property / cites work: SOFSEM 2005: Theory and Practice of Computer Science / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized algorithmics for linear arrangement problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parametrized complexity theory. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Incidence matrices and interval graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lex-BFS and partition refinement, with applications to transitive orientation, interval graph recognition and consecutive ones testing / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on the consecutive ones submatrix problem. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for hitting objects with straight lines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cyclical scheduling and multi-shift scheduling: complexity and approximation algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Simple Test for the Consecutive Ones Property / rank
 
Normal rank
Property / cites work
 
Property / cites work: PC trees and circular-ones arrangements. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Vertex cover might be hard to approximate to within \(2 - \varepsilon \) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recognizing graphs without asteroidal triples / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Incremental Linear-Time Algorithm for Recognizing Interval Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial Complete Consecutive Information Retrieval Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Certifying Algorithms for Recognizing Interval Graphs and Permutation Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5501338 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Station Location - Complexity and Approximation. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms – ESA 2004 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the consecutive ones property / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5710169 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The weighted consecutive ones problem for a fixed number of rows or columns. / rank
 
Normal rank
Property / cites work
 
Property / cites work: The simultaneous consecutive ones problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Set covering with almost consecutive ones property / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph Drawing / rank
 
Normal rank
Property / cites work
 
Property / cites work: The consecutive ones submatrix problem for sparse matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matrix characterizations of circular-arc graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A structure theorem for the consecutive 1's property / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for metric facility location and <i>k</i> -Median problems using the primal-dual schema and Lagrangian relaxation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Capacity Scheduling—I / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation of the Consecutive Ones Matrix Augmentation Problem / rank
 
Normal rank

Latest revision as of 20:17, 2 July 2024

scientific article
Language Label Description Also known as
English
Approximation and fixed-parameter algorithms for consecutive ones submatrix problems
scientific article

    Statements

    Approximation and fixed-parameter algorithms for consecutive ones submatrix problems (English)
    0 references
    0 references
    0 references
    0 references
    25 May 2010
    0 references
    consecutive ones property
    0 references
    circular ones property
    0 references
    forbidden submatrix characterization
    0 references
    NP-hard problem
    0 references
    fixed-parameter tractability
    0 references
    exact algorithms
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers