Polynomial Complete Consecutive Information Retrieval Problems
From MaRDI portal
Cited in
(30)- Preemptive scheduling and antichain polyhedra
- Once more on storage for consecutive retrieval
- Consecutive retrieval with redundancy: An optimal linear and an optimal cyclic arrangement and their storage space requirements
- On the storage space requirement of consecutive retrieval with redundancy
- One more polynomial complete consecutive retrieval problem
- On strings containing all subsets as substrings
- Combinatorial optimization models for production scheduling in automated manufacturing systems
- More on the complexity of common superstring and supersequence problems
- Algorithmic characterizations of interval orderd hypergraphs and applications
- Heuristic methods for gang-rip saw arbor design.
- A multichannel storage arrangement scheme of pictorial databases for concurrent spatial match retrieval
- Page-queries as a tool for organizing secondary memory auxiliary databases. I: Algorithmic aspects and architectural framework of query processing
- Page-queries as a tool for organizing secondary memory auxiliary databases. II: Optimal selection of SADB contents
- A note on the consecutive ones submatrix problem.
- Polynomial-time local-improvement algorithm for consecutive block minimization
- Minimising the number of gap-zeros in binary matrices
- Hamiltonicity of regular graphs and blocks of consecutive ones in symmetric matrices
- Heuristic methods to consecutive block minimization
- Iterated local search for consecutive block minimization
- A polynomial-time algorithm for finding a minimal conflicting set containing a given row
- Polyhedral Reformulation of a Scheduling Problem And Related Theoretical Results
- On Physical Mapping and the consecutive ones property for sparse matrices
- Exponential neighborhood search for consecutive block minimization
- On computing optimal linear diagrams
- Consecutive ones property and PQ-trees for multisets: hardness of counting their orderings
- A faster algorithm for finding minimum Tucker submatrices
- Box covers and domain orderings for beyond worst-case join processing
- Recognizing graphs with fixed interval number is NP-complete
- Approximation and fixed-parameter algorithms for consecutive ones submatrix problems
- Consecutive block minimization is 1.5-approximable
This page was built for publication: Polynomial Complete Consecutive Information Retrieval Problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4125734)
