Pages that link to "Item:Q5259608"
From MaRDI portal
The following pages link to Multiway cut, pairwise realizable distributions, and descending thresholds (Q5259608):
Displaying 21 items.
- Experimental evaluation of a local search approximation algorithm for the multiway cut problem (Q831743) (← 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)
- Geometric multicut: shortest fences for separating groups of objects in the plane (Q2207588) (← links)
- A simple algorithm for the multiway cut problem (Q2294387) (← links)
- Beating the 2-approximation factor for global bicut (Q2316621) (← links)
- Approximation algorithms for vertex happiness (Q2326078) (← links)
- Improved Approximation Algorithms for the Maximum Happy Vertices and Edges Problems (Q3196381) (← links)
- Simplex Partitioning via Exponential Clocks and the Multiway-Cut Problem (Q4577771) (← links)
- Approximation Algorithms for CSPs (Q4993604) (← links)
- Simplex Transformations and the Multiway Cut Problem (Q5000653) (← links)
- Global and fixed-terminal cuts in digraphs (Q5002602) (← links)
- Fixed parameter approximation scheme for min-max \(k\)-cut (Q5918433) (← links)
- Improving the integrality gap for multiway cut (Q5918912) (← links)
- Fixed parameter approximation scheme for min-max \(k\)-cut (Q5925652) (← links)
- Vertex downgrading to minimize connectivity (Q6038644) (← links)
- Approximating Requirement Cut via a Configuration LP (Q6084417) (← links)
- A local search approximation algorithm for the multiway cut problem (Q6166037) (← links)
