Consecutive block minimization is 1.5-approximable (Q975428): 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.ipl.2008.04.009 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2080076073 / 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: Consecutive retrieval property -- revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on the NP-hardness of the consecutive block minimization problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: PC trees and circular-ones arrangements. / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Compact Storage Scheme for the Solution of Symmetric Linear Simultaneous Equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial Complete Consecutive Information Retrieval Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5187226 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the hardness of approximating minimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the consecutive ones property / rank
 
Normal rank
Property / cites work
 
Property / cites work: A structure theorem for the consecutive 1's property / rank
 
Normal rank

Latest revision as of 21:24, 2 July 2024

scientific article
Language Label Description Also known as
English
Consecutive block minimization is 1.5-approximable
scientific article

    Statements

    Identifiers