The following pages link to On the multiway cut polyhedron (Q3971221):
Displaying 30 items.
- 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)
- An approximation algorithm for the generalized \(k\)-multicut problem (Q423940) (← links)
- Primal-dual approximation algorithms for integral flow and multicut in trees (Q679443) (← links)
- Minimal multicut and maximal integer multiflow: a survey (Q707131) (← links)
- Improved parameterized and exact algorithms for cut problems on trees (Q896125) (← links)
- The planar multiterminal cut problem (Q1130183) (← links)
- Cliques and clustering: A combinatorial approach (Q1267180) (← links)
- Minimum multiway cuts in trees (Q1270773) (← links)
- The node capacitated graph partitioning problem: A computational study (Q1290618) (← links)
- On weighted multiway cuts in trees (Q1334954) (← links)
- Cluster analysis and mathematical programming (Q1365055) (← links)
- An improved approximation algorithm of MULTIWAY CUT. (Q1577011) (← links)
- The critical node detection problem in networks: a survey (Q1750314) (← links)
- Evolutionary trees: An integer multicommodity max-flow -- min-cut theorem (Q1802347) (← links)
- Extended formulations for the \(A\)-cut problem (Q1915806) (← links)
- Hardness of approximation for crossing number (Q1943651) (← links)
- On the (near) optimality of extended formulations for multi-way cut in social networks (Q2129209) (← links)
- Parameterized complexity of happy coloring problems (Q2192381) (← links)
- On integer and bilevel formulations for the \(k\)-vertex cut problem (Q2195678) (← links)
- Complexity of the multicut problem, in its vanilla, partial and generalized versions, in graphs of bounded treewidth (Q2290633) (← links)
- Constrained coalition formation on valuation structures: formal framework, applications, and islands of tractability (Q2409675) (← links)
- The vertex \(k\)-cut problem (Q2419357) (← links)
- On the generalized multiway cut in trees problem (Q2436662) (← links)
- Optimal 3-terminal cuts and linear programming (Q2490332) (← links)
- Linear Time Algorithms for Happy Vertex Coloring Problems for Trees (Q2819511) (← links)
- Multiway cut and integer flow problems in trees (Q3439138) (← links)
- Primal-dual approximation algorithms for integral flow and multicut in trees, with applications to matching and set cover (Q4630249) (← links)
- Multiway cuts in directed and node weighted graphs (Q4632450) (← links)
- On minimum 3-cuts and approximating k-cuts using Cut Trees (Q4645919) (← links)
- Nonlinear formulations and improved randomized approximation algorithms for multicut problems (Q5101403) (← links)
