On the complexity and approximability of repair position selection problem
type: Item
instance of: scholarly article
title: On the complexity and approximability of repair position selection problem
zbMATH Open document ID: 1480.90214
author: Xianmin Liu
author: Yingshu Li
author: Jianzhong Li
author: Yuqiang Feng
published in: Journal of Combinatorial Optimization
publication date: 2021-11-25T00:00:00Z
Mathematics Subject Classification ID: 90C27
zbMATH DE Number: 7433392
zbMATH Keywords: inconsistent data
zbMATH Keywords: repair position
zbMATH Keywords: RPS
zbMATH Keywords: complexity
MaRDI profile type: Publication
full work available at URL: s10878-018-0362-y
OpenAlex ID: W2900713997
cites work: Q4864249
cites work: Answer sets for consistent query answering in inconsistent databases
cites work: Minimal-change integrity maintenance using tuple deletions
cites work: Updates of Relational Views
cites work: A threshold of ln n for approximating set cover
cites work: The dense \(k\)-subgraph problem
cites work: First-order query rewriting for inconsistent databases
cites work: Q5519710
cites work: On the complexity of sampling query feedback restricted database repair of functional dependency violations
cites work: Q4414548
Wikidata QID: Q128906179
DOI: 10.1007/S10878-018-0362-Y
description: scientific article; zbMATH DE number 7433392