The following pages link to Approximating directed multicuts (Q2387182):
Displaying 12 items.
- On the advantage of overlapping clusters for minimizing conductance (Q472486) (← links)
- Register loading via linear programming (Q494793) (← links)
- A lower bound on the integrality gap for minimum multicut in directed networks (Q705752) (← links)
- The checkpoint problem (Q714790) (← links)
- The multi-multiway cut problem (Q884458) (← links)
- An \(O(\sqrt n)\)-approximation algorithm for directed sparsest cut (Q1045922) (← links)
- Approximating minimum feedback sets and multicuts in directed graphs (Q1386376) (← links)
- Quasimetric embeddings and their applications (Q1799224) (← links)
- An approximate max-flow min-cut relation for undirected multicommodity flow, with applications (Q1894701) (← links)
- Multicommodity flows and cuts in polymatroidal networks (Q2826073) (← links)
- Online Maximum Directed Cut (Q3652298) (← links)
- Approximation and Online Algorithms (Q5713449) (← links)