Pages that link to "Item:Q3300759"
From MaRDI portal
The following pages link to LP Relaxation and Tree Packing for Minimum $k$-Cut (Q3300759):
Displaying 14 items.
- LP-relaxations for tree augmentation (Q1706120) (← links)
- Hypergraph \(k\)-cut in randomized polynomial time (Q2227530) (← links)
- Mean isoperimetry with control on outliers: exact and approximation algorithms (Q2672637) (← links)
- (Q5077149) (← links)
- Minimum Violation Vertex Maps and Their Applications to Cut Problems (Q5138968) (← links)
- On the hardness of approximating the \(k\)-\textsc{Way Hypergraph Cut} problem (Q5140849) (← links)
- Hypergraph <i>k</i>-Cut for Fixed <i>k</i> in Deterministic Polynomial Time (Q5870380) (← links)
- Fixed parameter approximation scheme for min-max \(k\)-cut (Q5918433) (← links)
- Fixed parameter approximation scheme for min-max \(k\)-cut (Q5925652) (← links)
- Partitioning subclasses of chordal graphs with few deletions (Q6144015) (← links)
- Deterministic enumeration of all minimum cut-sets and \(k\)-cut-sets in hypergraphs for fixed \(k\) (Q6608037) (← links)
- A polynomial time algorithm for finding a minimum 4-partition of a submodular function (Q6608049) (← links)
- Approximating submodular \(k\)-partition via principal partition sequence (Q6654129) (← links)
- A parameterized approximation scheme for min \(k\)-cut (Q6654555) (← links)
