Parameterized Algorithms for Matrix Completion With Radius Constraints

02/03/2020
by   Tomohiro Koana, et al.
0

Considering matrices with missing entries, we study NP-hard matrix completion problems where the resulting completed matrix shall have limited (local) radius. In the pure radius version, this means that the goal is to fill in the entries such that there exists a 'center string' which has Hamming distance to all matrix rows as small as possible. In stringology, this problem is also known as Closest String with Wildcards. In the local radius version, the requested center string must be one of the rows of the completed matrix. Hermelin and Rozenberg [CPM 2014, TCS 2016] performed parameterized complexity studies for Closest String with Wildcards. We answer one of their open questions, fix a bug concerning a fixed-parameter tractability result in their work, and improve some upper running time bounds. For the local radius case, we reveal a computational complexity dichotomy. In general, our results indicate that, although being NP-hard as well, this variant often allows for faster (fixed-parameter) algorithms.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
02/12/2020

Complexity of Combinatorial Matrix Completion With Diameter Constraints

We thoroughly study a novel and still basic combinatorial matrix complet...
research
04/10/2018

Parameterized Algorithms for the Matrix Completion Problem

We consider two matrix completion problems, in which we are given a matr...
research
09/26/2022

On the Parameterized Intractability of Determinant Maximization

In the Determinant Maximization problem, given an n× n positive semi-def...
research
11/28/2021

Computational Complexity of Normalizing Constants for the Product of Determinantal Point Processes

We consider the product of determinantal point processes (DPPs), a point...
research
04/13/2015

Streaming, Memory Limited Matrix Completion with Noise

In this paper, we consider the streaming memory-limited matrix completio...
research
11/16/2020

The Longest Run Subsequence Problem: Further Complexity Results

Longest Run Subsequence is a problem introduced recently in the context ...
research
11/04/2019

On Clustering Incomplete Data

We study fundamental clustering problems for incomplete data. In this se...

Please sign up or login with your details

Forgot password? Click here to reset