Pages that link to "Item:Q2784466"
From MaRDI portal
The following pages link to A 2-approximation algorithm for the directed multiway cut problem (Q2784466):
Displaying 19 items.
- A lower bound on the integrality gap for minimum multicut in directed networks (Q705752) (← links)
- Simple and improved parameterized algorithms for multiterminal cuts (Q987378) (← links)
- An \(O(\sqrt n)\)-approximation algorithm for directed sparsest cut (Q1045922) (← links)
- An improved approximation algorithm of MULTIWAY CUT. (Q1577011) (← links)
- A tight \(\sqrt{2} \)-approximation for linear 3-cut (Q2205984) (← links)
- A simple algorithm for the multiway cut problem (Q2294387) (← links)
- Beating the 2-approximation factor for global bicut (Q2316621) (← links)
- An improved parameterized algorithm for the minimum node multiway cut problem (Q2391180) (← links)
- The maximum integer multiterminal flow problem in directed graphs (Q2643793) (← links)
- Multicommodity flows and cuts in polymatroidal networks (Q2826073) (← links)
- Clique Cover and Graph Separation (Q2943572) (← links)
- Approximation Algorithms for Steiner and Directed Multicuts (Q3128195) (← links)
- Algorithms for Multiterminal Cuts (Q3503649) (← links)
- Algorithms for 2-Route Cut Problems (Q3521941) (← links)
- Simplex Partitioning via Exponential Clocks and the Multiway-Cut Problem (Q4577771) (← links)
- Simplex Transformations and the Multiway Cut Problem (Q5000653) (← links)
- Global and fixed-terminal cuts in digraphs (Q5002602) (← links)
- (Q5743512) (← links)
- Vertex downgrading to minimize connectivity (Q6038644) (← links)
