Sparse Solutions of Sparse Linear Systems: Fixed-Parameter Tractability and an Application of Complex Group Testing

  • Peter Damaschke
Conference paper

DOI: 10.1007/978-3-642-28050-4_8

Part of the Lecture Notes in Computer Science book series (LNCS, volume 7112)
Cite this paper as:
Damaschke P. (2012) Sparse Solutions of Sparse Linear Systems: Fixed-Parameter Tractability and an Application of Complex Group Testing. In: Marx D., Rossmanith P. (eds) Parameterized and Exact Computation. IPEC 2011. Lecture Notes in Computer Science, vol 7112. Springer, Berlin, Heidelberg

Abstract

A vector with at most k nonzeros is called k-sparse. We show that enumerating the support vectors of k-sparse solutions to a system Ax = b of r-sparse linear equations (i.e., where the rows of A are r-sparse) is fixed-parameter tractable (FPT) in the combined parameter r,k. For r = 2 the problem is simple. For 0,1-matrices A we can also compute an O(rkr) kernel. For systems of linear inequalities we get an FPT result in the combined parameter d,k, where d is the total number of minimal solutions. This is achieved by interpeting the problem as a case of group testing in the complex model. The problems stem from the reconstruction of chemical mixtures by observable reaction products.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2012

Authors and Affiliations

  • Peter Damaschke
    • 1
  1. 1.Department of Computer Science and EngineeringChalmers UniversityGöteborgSweden

Personalised recommendations