Showing cs.DSShow all
2 papers · 1 filter
cs.DS2023
Diversity Embeddings and the Hypergraph Sparsest Cut
Adam D. Jozefiak, F. Bruce Shepherd
Good approximations have been attained for the sparsest cut problem by rounding solutions to convex relaxations via low-distortion metric embeddings. Recently, Bryant and Tupper sh…
cs.DS2022
A Knapsack Intersection Hierarchy Applied to All-or-Nothing Flow in Trees
Adam Jozefiak, F. Bruce Shepherd, Noah Weninger
We introduce a natural knapsack intersection hierarchy for strengthening linear programming relaxations of packing integer programs, i.e., where…