Matrix completion: approximating the minimum diameter

DOI10.4230/LIPICS.ISAAC.2023.17MaRDI QIDQ6953203zbMATH OpenFDO

Authors Diptarka Chakraborty, Sanjana Dey

Publication date 24 July 2025

Copyright license Creative Commons Attribution 4.0 International

zbMATH Keywords

Hamming distanceincomplete datamatrix completionapproximation algorithmshardness of approximationdiameter minimization

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

This page was built for publication: Matrix completion: approximating the minimum diameter

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