Pages that link to "Item:Q3225074"
From MaRDI portal
The following pages link to An approximation algorithm for max<i>k</i>-uncut with capacity constraints (Q3225074):
Displaying 5 items.
- An approximation algorithm for the balanced Max-3-Uncut problem using complex semidefinite programming rounding (Q346478) (← links)
- Approximation and hardness results for the max \(k\)-uncut problem (Q1630990) (← links)
- New algorithms for a simple measure of network partitioning (Q2700788) (← links)
- Approximation and Hardness Results for the Max k-Uncut Problem (Q2958303) (← links)
- An approximation algorithm for max<i>k</i>-uncut with capacity constraints (Q3225074) (← links)
