Fixed-parameter tractability of error correction in graphical linear systems

DOI10.1007/978-3-642-36065-7_23MaRDI QIDQ4914452zbMATH OpenOpenAlexFDO

Authors Peter Damaschke, Ömer Eğecioğlu, Leonid Molokov

Publication date 12 April 2013

Published in WALCOM: Algorithms and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-36065-7_23

zbMATH Keywords

error correctioneven cycle matroidgirthparameterized algorithmsparse system of linear equations

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Numerical solutions to overdetermined systems, pseudoinverses (65F20) Computational methods for sparse matrices (65F50) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• Sparse solutions of sparse linear systems: fixed-parameter tractability and an application of complex group testing
• Sparse solutions of sparse linear systems: fixed-parameter tractability and an application of complex group testing
• Solving linear equations parameterized by Hamming weight
• LU factorization with errors
• Parameterized complexity of satisfying almost all linear equations over \(\mathbb F_2\)

Cited in

(3)

• Computing the spark: mixed-integer programming for the (vector) matroid girth problem
• Sparse solutions of sparse linear systems: fixed-parameter tractability and an application of complex group testing
• Sparse solutions of sparse linear systems: fixed-parameter tractability and an application of complex group testing

This page was built for publication: Fixed-parameter tractability of error correction in graphical linear systems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4914452)