Parameterized Algorithms for Matrix Completion with Radius Constraints.

DOI10.4230/LIPICS.CPM.2020.20MaRDI QIDQ5874448zbMATH OpenOpenAlexFDO

Authors Tomohiro Koana, Vincent Froese, Rolf Niedermeier

Publication date 7 February 2023

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

zbMATH Keywords

closest stringclosest string with wildcardsconsensus string problemsfixed-parameter tractability

Mathematics Subject Classification ID

Algorithms on strings (68W32)

Cited in

(7)

• The complexity of binary matrix completion under diameter constraints
• On the parameterized complexity of clustering problems for incomplete data
• From data completion to problems on hypercubes: a parameterized analysis of the independent set problem
• From data completion to problems on hypercubes: a parameterized analysis of the independent set problem
• Matrix completion: approximating the minimum diameter
• Finding a cluster in incomplete data
• Binary matrix completion under diameter constraints

This page was built for publication: Parameterized Algorithms for Matrix Completion with Radius Constraints.

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