The Weighted Sparsity Problem: Complexity and Algorithms

DOI10.1137/0406005MaRDI QIDQ5285937zbMATH OpenOpenAlexFDO

Authors S. Thomas McCormick, S. Frank Chang

Publication date 29 June 1993

Published in SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/0406005

zbMATH Keywords

computational complexitysparse matricesNP-hardbipartite matchingPolynomial algorithms

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50) Complexity and performance of numerical algorithms (65Y20) Analysis of algorithms and problem complexity (68Q25) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• Making sparse matrices sparser: Computational results
• A hierarchical algorithm for making sparse matrices sparser
• scientific article; zbMATH DE number 3905737
• Sparsification of rectangular matrices

Cited in

(3)

• scientific article; zbMATH DE number 3905737 (Why is no real title available?)
• Making sparse matrices sparser: Computational results
• Weighted thresholding homotopy method for sparsity constrained optimization

This page was built for publication: The Weighted Sparsity Problem: Complexity and Algorithms

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