Pages that link to "Item:Q2768265"
From MaRDI portal
The following pages link to Combinatorial approximation algorithms for the maximum directed cut problem (Q2768265):
Displaying 16 items.
- Online maximum directed cut (Q454250) (← links)
- A combinatorial algorithm for MAX CSP (Q1007550) (← links)
- An \(O(\sqrt n)\)-approximation algorithm for directed sparsest cut (Q1045922) (← links)
- A note on line digraphs and the directed max-cut problem (Q1174433) (← links)
- Max Horn SAT and the minimum cut problem in directed hypergraphs (Q1380929) (← links)
- Two approximation algorithms for maximizing nonnegative weakly monotonic set functions (Q2111542) (← links)
- Approximation algorithms for connected maximum cut and related problems (Q2304552) (← links)
- Oblivious algorithms for the maximum directed cut problem (Q2346965) (← links)
- Bounds on Double-Sided Myopic Algorithms for Unconstrained Non-monotoneSubmodular Maximization (Q2942658) (← links)
- A Tight Linear Time (1/2)-Approximation for Unconstrained Submodular Maximization (Q3449564) (← links)
- Online Submodular Maximization with Preemption (Q4972676) (← links)
- Streaming Complexity of Approximating Max 2CSP and Max Acyclic Subgraph (Q5002610) (← links)
- A Tight Approximation for Submodular Maximization with Mixed Packing and Covering Constraints (Q5091245) (← links)
- Constrained Submodular Maximization via a Nonsymmetric Technique (Q5108227) (← links)
- A spectral partitioning algorithm for maximum directed cut problem (Q5918387) (← links)
- Finding and using directed cuts of real graphs of algorithms (Q5930916) (← links)