Pages that link to "Item:Q5495798"

The following pages link to Sparsest cut on bounded treewidth graphs (Q5495798):

Displaying 12 items.

• Approximating graph-constrained max-cut (Q1800989) (← links)
• Sparsest cut in planar graphs, maximum concurrent flows and their connections with the max-cut problem (Q1800990) (← links)
• Strong reductions for extended formulations (Q1801022) (← links)
• A 2-approximation for the bounded treewidth sparsest cut problem in \textsf{FPT} Time (Q2164684) (← links)
• Integrality gaps for colorful matchings (Q2419586) (← links)
• Mean isoperimetry with control on outliers: exact and approximation algorithms (Q2672637) (← links)
• A Comprehensive Analysis of Polyhedral Lift-and-Project Methods (Q2790405) (← links)
• Max-Cut Under Graph Constraints (Q3186491) (← links)
• Sparsest Cut in Planar Graphs, Maximum Concurrent Flows and Their Connections with the Max-Cut Problem (Q3186492) (← links)
• A (1+epsilon)-Approximation for Makespan Scheduling with Precedence Constraints Using LP Hierarchies (Q4997320) (← links)
• (Q5009500) (← links)
• Cops, Robbers, and Threatening Skeletons: Padded Decomposition for Minor-Free Graphs (Q5232322) (← links)