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,857 | The Power of Tree Projections: Local Consistency, Greedy Algorithms, and Larger Islands of Tractability | 2010 | PODS | 5.5999311e-05 |
| 9,748 | Tractable Database Design through Bounded Treewidth | 2006 | PODS | 5.2795863e-05 |
| 1,151 | Hypertree Decompositions: Questions and Answers | 2016 | PODS | 0.00012031066 |
| 5,316 | HyperBench: A Benchmark and Tool for Hypergraphs and Empirical Findings | 2019 | PODS | 6.3391633e-05 |
| 2,471 | Hypertree Decompositions and Tractable Queries | 1999 | PODS | 8.6104977e-05 |
| 10,372 | Soft and Constrained Hypertree Width | 2025 | PODS | 5.1725247e-05 |
| 8,360 | Fast Parallel Hypertree Decompositions in Logarithmic Recursion Depth | 2022 | PODS | 5.500939e-05 |
| 903 | Generalized Hypertree Decompositions: NP-Hardness and Tractable Variants | 2007 | PODS | 0.00013361264 |
| 2,886 | Weighted Hypertree Decompositions and Optimal Query Plans | 2004 | PODS | 8.0645443e-05 |
| 11,135 | A Branch-&-Bound Algorithm for Fractional Hypertree Decomposition | 2024 | VLDB | 5.1725247e-05 |