Pages that link to "Item:Q5495824"
From MaRDI portal
The following pages link to Simplex partitioning via exponential clocks and the multiway cut problem (Q5495824):
Displaying 15 items.
- Approximation algorithms for stochastic combinatorial optimization problems (Q290321) (← links)
- Experimental evaluation of a local search approximation algorithm for the multiway cut problem (Q831743) (← links)
- Approximation and hardness results for the max \(k\)-uncut problem (Q1630990) (← links)
- Improved approximation algorithms for the maximum happy vertices and edges problems (Q1750352) (← links)
- Isolation branching: a branch and bound algorithm for the \(k \)-terminal cut problem (Q2082183) (← links)
- Solving \((k-1)\)-stable instances of \texttt{k-terminal cut} with isolating cuts (Q2125213) (← links)
- On the (near) optimality of extended formulations for multi-way cut in social networks (Q2129209) (← links)
- \(\ell_p\)-norm multiway cut (Q2165036) (← links)
- A simple algorithm for the multiway cut problem (Q2294387) (← links)
- Approximation algorithms for vertex happiness (Q2326078) (← links)
- An \(O^\ast(1.84^k)\) parameterized algorithm for the multiterminal cut problem (Q2445900) (← links)
- Approximation and Hardness Results for the Max k-Uncut Problem (Q2958303) (← links)
- Improved Approximation Algorithms for the Maximum Happy Vertices and Edges Problems (Q3196381) (← links)
- Approximation Algorithms for CSPs (Q4993604) (← links)
- A local search approximation algorithm for the multiway cut problem (Q6166037) (← links)
