Approximation Schemes for Low-rank Binary Matrix Approximation Problems

DOI10.1145/3365653zbMath1454.68180arXiv1807.07156OpenAlexW2986926078WikidataQ126798397 ScholiaQ126798397MaRDI QIDQ4973060

Daniel Lokshtanov, Saket Saurabh, Fahad Panolan, Petr A. Golovach, Fedor V. Fomin

Publication date: 2 December 2019

Published in: ACM Transactions on Algorithms (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1807.07156

zbMATH Keywords

clusteringrandom samplingapproximation schemebinary matrix factorization

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Factorization of matrices (15A23) Matrices over special rings (quaternions, finite fields, etc.) (15B33) Approximation algorithms (68W25) Randomized algorithms (68W20)

Related Items (4)

Parameterized complexity of categorical clustering with size constraints ⋮ On the parameterized complexity of clustering problems for incomplete data ⋮ Parameterized low-rank binary matrix approximation ⋮ Parameterized complexity of categorical clustering with size constraints

This page was built for publication: Approximation Schemes for Low-rank Binary Matrix Approximation Problems