Pages that link to "Item:Q1186785"

The following pages link to A fast algorithm for the generalized parametric minimum cut problem and applications (Q1186785):

Displayed 9 items.

• Baseball playoff eliminations: An application of linear programming. Erratum (Q807312) ‎ (← links)
• Parametric stable marriage and minimum cuts (Q913621) ‎ (← links)
• Complexity results for the \(p\)-median problem with mutual communication (Q1317006) ‎ (← links)
• A faster parametric minimum-cut algorithm (Q1317480) ‎ (← links)
• Dynamic expression trees (Q1346771) ‎ (← links)
• On some large-scale LP relaxations for the graph partitioning problem and their optimal solutions (Q1904713) ‎ (← links)
• A note on the parametric maximum flow problem and some related reoptimization issues (Q2480211) ‎ (← links)
• Universally maximum flow with piecewise-constant capacities (Q2764994) ‎ (← links)
• EFFICIENT ALGORITHMS FOR THE OPTIMAL-RATIO REGION DETECTION PROBLEMS IN DISCRETE GEOMETRY WITH APPLICATIONS (Q3636313) ‎ (← links)