Pages that link to "Item:Q5875475"
From MaRDI portal
The following pages link to Fast and Deterministic Approximations for k-Cut. (Q5875475):
Displaying 11 items.
- Approximation algorithms for minimum \(K\)-cut (Q1977137) (← links)
- (Q2753925) (← links)
- (Q3975935) (← links)
- (Q4357799) (← links)
- (Q4607983) (← links)
- (Q5009482) (← links)
- Optimal Bounds for the <i>k</i> -cut Problem (Q5066939) (← links)
- (Q5077149) (← links)
- A nearly 5/3-approximation FPT Algorithm for Min-<i>k</i>-Cut (Q5146830) (← links)
- Hypergraph <i>k</i>-Cut for Fixed <i>k</i> in Deterministic Polynomial Time (Q5870380) (← links)
- Approximating submodular \(k\)-partition via principal partition sequence (Q6654129) (← links)