Pages that link to "Item:Q2346965"
From MaRDI portal
The following pages link to Oblivious algorithms for the maximum directed cut problem (Q2346965):
Displayed 10 items.
- A unifying tool for bounding the quality of non-cooperative solutions in weighted congestion games (Q722221) (← links)
- Near-optimal asymmetric binary matrix partitions (Q1702119) (← links)
- Tight approximation bounds for combinatorial frugal coverage algorithms (Q2392738) (← links)
- Bounds on Double-Sided Myopic Algorithms for Unconstrained Non-monotoneSubmodular Maximization (Q2942658) (← links)
- Tight Approximation Bounds for Greedy Frugal Coverage Algorithms (Q3004668) (← links)
- Online Submodular Maximization with Preemption (Q4972676) (← links)
- Streaming Complexity of Approximating Max 2CSP and Max Acyclic Subgraph (Q5002610) (← links)
- A spectral partitioning algorithm for maximum directed cut problem (Q5918387) (← links)
- Truthful facility assignment with resource augmentation: an exact analysis of serial dictatorship (Q6120929) (← links)
- On maximizing sums of non-monotone submodular and linear functions (Q6130322) (← links)