Pages that link to "Item:Q1317477"
From MaRDI portal
The following pages link to A new saling algorithm for the maximum mean cut problem (Q1317477):
Displaying 8 items.
- Tight bounds on the number of minimum-mean cycle cancellations and related results (Q1317475) (← links)
- Approximate binary search algorithms for mean cuts and cycles (Q1319679) (← links)
- How to compute least infeasible flows (Q1373747) (← links)
- Fractional 0-1 programming: applications and algorithms (Q1675651) (← links)
- Fractional 0-1 programming and submodularity (Q2162513) (← links)
- Minimax inverse problems of minimum cuts (Q2782726) (← links)
- The quickest flow problem (Q4031968) (← links)
- A Fast Approximation Algorithm For The Subset-Sum Problem (Q4313818) (← links)
