The following pages link to (Q4542519):
Displayed 19 items.
- Extended cuts (Q266025) (← links)
- A lower bound of \(8/(7+\frac{1}{k-1})\) on the integrality ratio of the Călinescu-Karloff-Rabani relaxation for multiway cut (Q294793) (← links)
- Geometric rounding: A dependent randomized rounding scheme (Q411220) (← links)
- New geometry-inspired relaxations and algorithms for the metric Steiner tree problem (Q647390) (← links)
- Minimal multicut and maximal integer multiflow: a survey (Q707131) (← links)
- Experimental evaluation of a local search approximation algorithm for the multiway cut problem (Q831743) (← links)
- The multi-multiway cut problem (Q884458) (← 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)
- Mixed-case community detection problem in social networks: algorithms and analysis (Q2220864) (← links)
- Approximation algorithms for vertex happiness (Q2326078) (← links)
- Optimal 3-terminal cuts and linear programming (Q2490332) (← links)
- (Q2861519) (← links)
- On the minimum cut separator problem (Q2892143) (← links)
- Lifting Methods for Manifold-Valued Variational Problems (Q3300534) (← links)
- Approximation Algorithms for CSPs (Q4993604) (← links)
- Solving LP Relaxations of Some NP-Hard Problems Is As Hard As Solving Any Linear Program (Q5231683) (← links)
- (Q5743427) (← links)
- A local search approximation algorithm for the multiway cut problem (Q6166037) (← links)