Fast Hypertree Decompositions via Linear Programming: Fractional and Generalized
Summary: Ralph computes fractional and generalized hypertree decompositions via LP randomized approximation. MILP/LP heuristics atop Korchemna et al.'s poly-time fractional approximation enable near-optimal decompositions on HyperBench and solving 500 unsolved instances. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
No non-self incoming citations found for this paper in this database.
Authors
Incoming Citations (Sorted by Pagerank)
Showing 0 of 0 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 16 of 16 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
Previous
Page 1 / 1
Next
Semantically Similar Papers
| Overall Rank | Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 7,473 | The Power of Tree Projections: Local Consistency, Greedy Algorithms, and Larger Islands of Tractability | 2010 | PODS | 4.7198203e-05 |
| 9,740 | Tractable Database Design through Bounded Treewidth | 2006 | PODS | 4.2936538e-05 |
| 1,328 | Hypertree Decompositions: Questions and Answers | 2016 | PODS | 0.00012565612 |
| 5,077 | HyperBench: A Benchmark and Tool for Hypergraphs and Empirical Findings | 2019 | PODS | 5.7153846e-05 |
| 2,796 | Hypertree Decompositions and Tractable Queries | 1999 | PODS | 8.1112658e-05 |
| 10,360 | Soft and Constrained Hypertree Width | 2025 | PODS | 4.1945683e-05 |
| 8,486 | Fast Parallel Hypertree Decompositions in Logarithmic Recursion Depth | 2022 | PODS | 4.4999394e-05 |
| 626 | Generalized Hypertree Decompositions: NP-Hardness and Tractable Variants | 2007 | PODS | 0.00018973823 |
| 1,038 | Weighted Hypertree Decompositions and Optimal Query Plans | 2004 | PODS | 0.00014492414 |
| 11,132 | A Branch-&-Bound Algorithm for Fractional Hypertree Decomposition | 2024 | VLDB | 4.1945683e-05 |