Pages that link to "Item:Q3588403"
From MaRDI portal
The following pages link to Approximating Sparsest Cut in Graphs of Bounded Treewidth (Q3588403):
Displayed 7 items.
- The complexity of finding uniform sparsest cuts in various graph classes (Q450559) (← links)
- A 2-approximation for the bounded treewidth sparsest cut problem in \textsf{FPT} Time (Q2164684) (← links)
- Integrality gaps for colorful matchings (Q2419586) (← links)
- Pathwidth, trees, and random embeddings (Q2439830) (← links)
- The Complexity Status of Problems Related to Sparsest Cuts (Q3000501) (← links)
- Semidefinite and Linear Programming Integrality Gaps for Scheduling Identical Machines (Q3186499) (← links)
- A (1+epsilon)-Approximation for Makespan Scheduling with Precedence Constraints Using LP Hierarchies (Q4997320) (← links)