Combinatorial approximation algorithms for the maximum directed cut problem
From MaRDI portal
Recommendations
Cited in
(19)- A combinatorial algorithm for MAX CSP
- An O( n)-approximation algorithm for directed sparsest cut
- A note on line digraphs and the directed max-cut problem
- Max Horn SAT and the minimum cut problem in directed hypergraphs
- Two approximation algorithms for maximizing nonnegative weakly monotonic set functions
- Oblivious algorithms for the maximum directed cut problem
- scientific article; zbMATH DE number 1670527 (Why is no real title available?)
- Bounds on double-sided myopic algorithms for unconstrained non-monotone submodular maximization
- A tight linear time (1/2)-approximation for unconstrained submodular maximization
- Online maximum directed cut
- Online submodular maximization with preemption
- Streaming complexity of approximating Max 2CSP and Max Acyclic Subgraph
- A Tight Approximation for Submodular Maximization with Mixed Packing and Covering Constraints
- Constrained submodular maximization via a nonsymmetric technique
- A spectral partitioning algorithm for maximum directed cut problem
- A spectral partitioning algorithm for maximum directed cut problem
- Finding and using directed cuts of real graphs of algorithms
- Approximation algorithms for two extensions of min-k-union
- Deterministic algorithms for k-submodular maximization with the chance constraint
This page was built for publication: Combinatorial approximation algorithms for the maximum directed cut problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2768265)
