Parameterized Algorithms for Matrix Completion with Radius Constraints.

DOI10.4230/LIPIcs.CPM.2020.20OpenAlexW3037663249MaRDI QIDQ5874448

Rolf Niedermeier, Tomohiro Koana, Vincent Froese

Publication date: 7 February 2023

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

zbMATH Keywords

fixed-parameter tractabilityclosest stringconsensus string problemsclosest string with wildcards

Mathematics Subject Classification ID

Algorithms on strings (68W32)

Related Items (2)

The complexity of binary matrix completion under diameter constraints ⋮ On the parameterized complexity of clustering problems for incomplete data

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