Pages that link to "Item:Q2719167"
From MaRDI portal
The following pages link to A 0.5-Approximation Algorithm for MAX DICUT with Given Sizes of Parts (Q2719167):
Displayed 12 items.
- Improved approximation algorithms for maximum graph partitioning problems (Q813332) (← links)
- The capacitated max \(k\)-cut problem (Q930343) (← links)
- Approximating graph-constrained max-cut (Q1800989) (← links)
- Approximation algorithm for MAX DICUT with given sizes of parts (Q1879136) (← links)
- A new greedy strategy for maximizing monotone submodular function under a cardinality constraint (Q2141724) (← links)
- Maximizing a non-decreasing non-submodular function subject to various types of constraints (Q2154448) (← links)
- Approximating max-cut under graph-MSO constraints (Q2294245) (← links)
- The fundamental theorem of linear programming: extensions and applications (Q2996803) (← links)
- Max-Cut Under Graph Constraints (Q3186491) (← links)
- An approximation algorithm for max<i>k</i>-uncut with capacity constraints (Q3225074) (← links)
- Constrained Assortment Optimization Under the Paired Combinatorial Logit Model (Q5080643) (← links)
- A maximum dicut in a digraph induced by a minimal dominating set (Q5090164) (← links)