A good submatrix is hard to find
From MaRDI portal
Publication:1836717
DOI10.1016/0167-6377(82)90038-4zbMATH Open0506.15012OpenAlexW2002630401MaRDI QIDQ1836717FDOQ1836717
Publication date: 1982
Published in: Operations Research Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0167-6377(82)90038-4
NP-completenesshereditary propertyidentification problemmonotone propertysubmatrixidentification of submatrices
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Decomposition of regular matroids
- The node-deletion problem for hereditary properties is NP-complete
- Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms
- Incidence matrices and interval graphs
- Node-Deletion Problems on Bipartite Graphs
- Title not available (Why is that?)
- Converting Linear Programs to Network Problems
- Matrix characterizations of circular-arc graphs
- Title not available (Why is that?)
- On the complexity of the Maximum Subgraph Problem
Cited In (18)
- Perturbations of the \textsc{Tcur} decomposition for tensor valued data in the Tucker format
- Generalizing the column-row matrix decomposition to multi-way arrays
- Use of hidden network structure in the set partitioning problem
- Parallel cross interpolation for high-precision calculation of high-dimensional integrals
- Linear optimization over homogeneous matrix cones
- Extracting embedded generalized networks from linear programming problems
- A network relaxation based enumeration algorithm for set partitioning
- Block discrete empirical interpolation methods
- Robust CUR Decomposition: Theory and Imaging Applications
- The maximum balanced subgraph of a signed graph: applications and solution approaches
- The practical conversion of linear programmes to network flow models
- Optimal Transitions for Targeted Protein Quantification: Best Conditioned Submatrix Selection
- A branch-and-cut algorithm for the maximum \(k\)-balanced subgraph of a signed graph
- An exact approach to the problem of extracting an embedded network matrix
- Rectangular maximum-volume submatrices and their applications
- Quasioptimality of maximum-volume cross interpolation of tensors
- Extracting pure network submatrices in linear programs using signed graphs.
- Fixed-parameter algorithms in analysis of heuristics for extracting networks in linear programs
This page was built for publication: A good submatrix is hard to find
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1836717)
