The following pages link to On the \(k\)-cut problem (Q1977642):
Displaying 15 items.
- Dynamic evolution of economically preferred facilities (Q954890) (← links)
- Bidirected and unidirected capacity installation in telecommunication networks. (Q1417563) (← links)
- The problem of \(\Pi_{2}\)-cut-introduction (Q1680562) (← links)
- Lovász extension and graph cut (Q2057034) (← links)
- On integer and bilevel formulations for the \(k\)-vertex cut problem (Q2195678) (← links)
- Algorithms for the non-bifurcated network design problem (Q2271128) (← links)
- The vertex \(k\)-cut problem (Q2419357) (← links)
- Approximating \(k\)-cuts using network strength as a Lagrangean relaxation (Q2462107) (← links)
- Generalized \(k\)-multiway cut problems (Q2504075) (← links)
- LP Relaxation and Tree Packing for Minimum $k$-Cut (Q3300759) (← links)
- (Q3789006) (← links)
- Optimal Bounds for the <i>k</i> -cut Problem (Q5066939) (← links)
- (Q5077149) (← links)
- Fast and Deterministic Approximations for k-Cut. (Q5875475) (← links)
- Approximating submodular \(k\)-partition via principal partition sequence (Q6654129) (← links)
