Pages that link to "Item:Q1915806"
From MaRDI portal
The following pages link to Extended formulations for the \(A\)-cut problem (Q1915806):
Displaying 8 items.
- A note on formulations for the \(A\)-partition problem on hypergraphs (Q1276964) (← links)
- Cluster analysis and mathematical programming (Q1365055) (← links)
- An improved approximation algorithm of MULTIWAY CUT. (Q1577011) (← links)
- An extended formulation of the convex recoloring problem on a tree (Q1675254) (← links)
- The critical node detection problem in networks: a survey (Q1750314) (← links)
- Extended formulations for the \(A\)-cut problem (Q1915806) (← links)
- On the (near) optimality of extended formulations for multi-way cut in social networks (Q2129209) (← links)
- Nonlinear formulations and improved randomized approximation algorithms for multicut problems (Q5101403) (← links)