Matrix sparsification and the sparse null space problem

Lee Ad Gottlieb; Tyler Neylon

doi:10.1007/978-3-642-15369-3_16

Matrix sparsification and the sparse null space problem

Lee Ad Gottlieb, Tyler Neylon

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

22 Scopus citations

Abstract

We revisit the matrix problems sparse null space and matrix sparsification, and show that they are equivalent. We then proceed to seek algorithms for these problems: We prove the hardness of approximation of these problems, and also give a powerful tool to extend algorithms and heuristics for sparse approximation theory to these problems.

Original language	English
Title of host publication	Approximation, Randomization, and Combinatorial Optimization
Subtitle of host publication	Algorithms and Techniques - 13th International Workshop, APPROX 2010 and 14th International Workshop, RANDOM 2010, Proceedings
Pages	205-218
Number of pages	14
DOIs	https://doi.org/10.1007/978-3-642-15369-3_16
State	Published - 2010
Externally published	Yes
Event	13th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2010 and 14th International Workshop on Randomization and Computation, RANDOM 2010 - Barcelona, Spain Duration: 1 Sep 2010 → 3 Sep 2010

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	6302 LNCS
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Conference

Conference	13th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2010 and 14th International Workshop on Randomization and Computation, RANDOM 2010
Country/Territory	Spain
City	Barcelona
Period	1/09/10 → 3/09/10

Access to Document

10.1007/978-3-642-15369-3_16

Cite this

Gottlieb, L. A., & Neylon, T. (2010). Matrix sparsification and the sparse null space problem. In Approximation, Randomization, and Combinatorial Optimization: Algorithms and Techniques - 13th International Workshop, APPROX 2010 and 14th International Workshop, RANDOM 2010, Proceedings (pp. 205-218). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 6302 LNCS). https://doi.org/10.1007/978-3-642-15369-3_16

Gottlieb, Lee Ad ; Neylon, Tyler. / Matrix sparsification and the sparse null space problem. Approximation, Randomization, and Combinatorial Optimization: Algorithms and Techniques - 13th International Workshop, APPROX 2010 and 14th International Workshop, RANDOM 2010, Proceedings. 2010. pp. 205-218 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{aa8c11f93f574d84a62cc3a3d039e1dd,

title = "Matrix sparsification and the sparse null space problem",

abstract = "We revisit the matrix problems sparse null space and matrix sparsification, and show that they are equivalent. We then proceed to seek algorithms for these problems: We prove the hardness of approximation of these problems, and also give a powerful tool to extend algorithms and heuristics for sparse approximation theory to these problems.",

author = "Gottlieb, {Lee Ad} and Tyler Neylon",

year = "2010",

doi = "10.1007/978-3-642-15369-3_16",

language = "אנגלית",

isbn = "3642153682",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

pages = "205--218",

booktitle = "Approximation, Randomization, and Combinatorial Optimization",

note = "13th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2010 and 14th International Workshop on Randomization and Computation, RANDOM 2010 ; Conference date: 01-09-2010 Through 03-09-2010",

}

Gottlieb, LA & Neylon, T 2010, Matrix sparsification and the sparse null space problem. in Approximation, Randomization, and Combinatorial Optimization: Algorithms and Techniques - 13th International Workshop, APPROX 2010 and 14th International Workshop, RANDOM 2010, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 6302 LNCS, pp. 205-218, 13th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2010 and 14th International Workshop on Randomization and Computation, RANDOM 2010, Barcelona, Spain, 1/09/10. https://doi.org/10.1007/978-3-642-15369-3_16

Matrix sparsification and the sparse null space problem. / Gottlieb, Lee Ad; Neylon, Tyler.
Approximation, Randomization, and Combinatorial Optimization: Algorithms and Techniques - 13th International Workshop, APPROX 2010 and 14th International Workshop, RANDOM 2010, Proceedings. 2010. p. 205-218 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 6302 LNCS).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Matrix sparsification and the sparse null space problem

AU - Gottlieb, Lee Ad

AU - Neylon, Tyler

PY - 2010

Y1 - 2010

N2 - We revisit the matrix problems sparse null space and matrix sparsification, and show that they are equivalent. We then proceed to seek algorithms for these problems: We prove the hardness of approximation of these problems, and also give a powerful tool to extend algorithms and heuristics for sparse approximation theory to these problems.

AB - We revisit the matrix problems sparse null space and matrix sparsification, and show that they are equivalent. We then proceed to seek algorithms for these problems: We prove the hardness of approximation of these problems, and also give a powerful tool to extend algorithms and heuristics for sparse approximation theory to these problems.

UR - http://www.scopus.com/inward/record.url?scp=78149306565&partnerID=8YFLogxK

U2 - 10.1007/978-3-642-15369-3_16

DO - 10.1007/978-3-642-15369-3_16

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???

AN - SCOPUS:78149306565

SN - 3642153682

SN - 9783642153686

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 205

EP - 218

BT - Approximation, Randomization, and Combinatorial Optimization

T2 - 13th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2010 and 14th International Workshop on Randomization and Computation, RANDOM 2010

Y2 - 1 September 2010 through 3 September 2010

ER -

Gottlieb LA, Neylon T. Matrix sparsification and the sparse null space problem. In Approximation, Randomization, and Combinatorial Optimization: Algorithms and Techniques - 13th International Workshop, APPROX 2010 and 14th International Workshop, RANDOM 2010, Proceedings. 2010. p. 205-218. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/978-3-642-15369-3_16

Matrix sparsification and the sparse null space problem

Abstract

Publication series

Conference

Access to Document

Other files and links

Fingerprint

Cite this