The Computation of Optimal Subset Repairs
Summary: New tight inapproximability for optimal subset repairs: NP-hard to approximate within 17/16. Presents a (2 - 1/2^{sigma-1})-approx algorithm (sigma = number of FDs), the current best; ratio improves with many quasi-Turan clusters; validated on real data. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Dongjing Miao
- 2. Zhipeng Cai
- 3. Jianzhong Li
- 4. Xiangyu Gao
- 5. Xianmin Liu
Incoming Citations (Sorted by Pagerank)
Showing 3 of 3 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 8,840 | The Cost of Representation by Subset Repairs | 2025 | VLDB | 4.4388652e-05 |
| 10,213 | Stress-Testing Causal Claims via Cardinality Repairs | 2026 | SIGMOD | 4.1945683e-05 |
| 11,195 | rkHit: Representative Query with Uncertain Preference | 2023 | SIGMOD | 4.1945683e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 13 of 13 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
Previous
Page 1 / 1
Next