Pages that link to "Item:Q1630990"
From MaRDI portal
The following pages link to Approximation and hardness results for the max \(k\)-uncut problem (Q1630990):
Displaying 4 items.
- A note on anti-coordination and social interactions (Q386417) (← links)
- New algorithms for a simple measure of network partitioning (Q2700788) (← links)
- Approximating max \(k\)-uncut via LP-rounding plus greed, with applications to densest \(k\)-subgraph (Q5918330) (← links)
- Approximating max \(k\)-uncut via LP-rounding plus greed, with applications to densest \(k\)-subgraph (Q5919045) (← links)