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. We give different branching algorithms based on the close relationship to the hitting set problem in fixed-rank hypergraphs. 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 interpreting 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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.