Pages that link to "Item:Q5494941"
From MaRDI portal
The following pages link to Min-Max Graph Partitioning and Small Set Expansion (Q5494941):
Displaying 9 items.
- An exact algorithm for min-max hyperstructure equipartition with a connected constraint (Q1652415) (← links)
- Hardness and efficiency on minimizing maximum distances for graphs with few \(P_4\)'s and \((k, \ell)\)-graphs (Q2132367) (← links)
- \(\ell_p\)-norm multiway cut (Q2165036) (← links)
- Parameterized algorithms for min-max multiway cut and list digraph homomorphism (Q2396830) (← links)
- Polynomial-time data reduction for weighted problems beyond additive goal functions (Q2685700) (← links)
- Minimum nonuniform graph partitioning with unrelated weights (Q4610203) (← links)
- Spanning Tree Congestion and Computation of Generalized Györi-Lovász Partition (Q5002702) (← links)
- Fixed parameter approximation scheme for min-max \(k\)-cut (Q5918433) (← links)
- Fixed parameter approximation scheme for min-max \(k\)-cut (Q5925652) (← links)
