Pages that link to "Item:Q5713449"
From MaRDI portal
The following pages link to Approximation and Online Algorithms (Q5713449):
Displaying 10 items.
- Approximation algorithms for the Bipartite Multicut problem (Q991784) (← links)
- An \(O(\sqrt n)\)-approximation algorithm for directed sparsest cut (Q1045922) (← links)
- Approximating \(\alpha\)-cuts with the vertex method (Q1311912) (← links)
- Approximating minimum feedback sets and multicuts in directed graphs (Q1386376) (← links)
- Approximating directed multicuts (Q2387182) (← links)
- Combinatorial approximation algorithms for the maximum directed cut problem (Q2768265) (← links)
- A 2-approximation algorithm for the directed multiway cut problem (Q2784466) (← links)
- Approximation Algorithms for Steiner and Directed Multicuts (Q3128195) (← links)
- Finding and using directed cuts of real graphs of algorithms (Q5930916) (← links)
- Approximation algorithms for feasible cut and multicut problems (Q6102317) (← links)