On the complexity and approximability of repair position selection problem

DOI10.1007/S10878-018-0362-YzbMath1480.90214OpenAlexW2900713997WikidataQ128906179 ScholiaQ128906179MaRDI QIDQ2051902

Xianmin Liu, Yuqiang Feng, Jian-Zhong Li, Yingshu Li

Publication date: 25 November 2021

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-018-0362-y

zbMATH Keywords

complexityinconsistent dataRPSrepair position

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• First-order query rewriting for inconsistent databases
• On the complexity of sampling query feedback restricted database repair of functional dependency violations
• Minimal-change integrity maintenance using tuple deletions
• A threshold of ln n for approximating set cover
• Updates of Relational Views
• Answer sets for consistent query answering in inconsistent databases
• The dense \(k\)-subgraph problem

This page was built for publication: On the complexity and approximability of repair position selection problem