Jaguar evaluates Boolean conjunctive queries in O(N^{subw(Q) + ε}) time for any ε > 0 by operating directly in the primal space of polymatroids and adaptively bounding join costs.
Title resolution pending
2 Pith papers cite this work, alongside 146 external citations. Polarity classification is still indexing.
2
Pith papers citing it
146
external citations · OpenAlex
citation-role summary
background 1
citation-polarity summary
years
2026 2roles
background 1polarities
background 1representative citing papers
Submodular width is approximated within 3/2 by a branchwidth parameter from edge separations and admissible submodular costs, and satisfies subw(H) = Omega(ghw(H) / log ghw(H)) under natural conditions.
citing papers explorer
-
Jaguar: A Primal Algorithm for Conjunctive Query Evaluation in Submodular-Width Time
Jaguar evaluates Boolean conjunctive queries in O(N^{subw(Q) + ε}) time for any ε > 0 by operating directly in the primal space of polymatroids and adaptively bounding join costs.
-
Cuts and Gauges for Submodular Width
Submodular width is approximated within 3/2 by a branchwidth parameter from edge separations and admissible submodular costs, and satisfies subw(H) = Omega(ghw(H) / log ghw(H)) under natural conditions.