Sparse solutions of sparse linear systems: fixed-parameter tractability and an application of complex group testing
From MaRDI portal
Publication:2891340
DOI10.1007/978-3-642-28050-4_8zbMATH Open1352.68101OpenAlexW1487078199MaRDI QIDQ2891340FDOQ2891340
Authors: Peter Damaschke 
Publication date: 15 June 2012
Published in: Parameterized and Exact Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-28050-4_8
Recommendations
- Sparse solutions of sparse linear systems: fixed-parameter tractability and an application of complex group testing
- A note on sparse solutions of sparse linear systems
- Fixed-parameter tractability of error correction in graphical linear systems
- Sparse Approximate Solutions to Linear Systems
- Solving linear equations parameterized by Hamming weight
Computational methods for sparse matrices (65F50) Analysis of algorithms and problem complexity (68Q25)
Cites Work
- Title not available (Why is that?)
- Sparse nonnegative solution of underdetermined linear equations by linear programming
- A top-down approach to search-trees: Improved algorithmics for 3-hitting set
- Sparse Approximate Solutions to Linear Systems
- A group testing problem for hypergraphs of bounded rank
- On the Uniqueness of Nonnegative Sparse Solutions to Underdetermined Systems of Equations
- The union of minimal hitting sets: parameterized combinatorial bounds and counting
- A group testing problem for graphs with several defective edges
- On sparse solutions of underdetermined linear systems
- A Unique “Nonnegative” Solution to an Underdetermined System: From Vectors to Matrices
- Parameterized enumeration, transversals, and imperfect phylogeny reconstruction
- A competitive algorithm in searching for many edges in a hypergraph
- Parameterized algorithms for \(d\)-hitting set: the weighted case
Cited In (4)
- Sparse solutions of sparse linear systems: fixed-parameter tractability and an application of complex group testing
- Sparse representation of vectors in lattices and semigroups
- Fixed-parameter tractability of error correction in graphical linear systems
- A note on sparse solutions of sparse linear systems
This page was built for publication: Sparse solutions of sparse linear systems: fixed-parameter tractability and an application of complex group testing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2891340)
