Pages that link to "Item:Q3967364"

The following pages link to Selected Applications of Minimum Cuts in Networks (Q3967364):

Displaying 32 items.

• The \textsc{max quasi-independent set} problem (Q434194) (← links)
• Structural and algorithmic properties for parametric minimum cuts (Q715078) (← links)
• An efficient algorithm for the minimum capacity cut problem (Q922927) (← links)
• A unified approach to finding good stable matchings in the hospitals/residents setting (Q930917) (← links)
• Testing membership in matroid polyhedra (Q1056350) (← links)
• The poset scheduling problem (Q1062616) (← links)
• On the efficiency of maximum-flow algorithms on networks with small integer capacities (Q1111460) (← links)
• The planar multiterminal cut problem (Q1130183) (← links)
• The complexity of controlled selection (Q1173958) (← links)
• Using separation algorithms to generate mixed integer model reformulations (Q1178714) (← links)
• Transitions in geometric minimum spanning trees (Q1199130) (← links)
• Polyhedral results for the precedence-constrained knapsack problem (Q1208480) (← links)
• Extracting maximal information about sets of minimum cuts (Q1261290) (← links)
• Minimizing a submodular function arising from a concave function (Q1304480) (← links)
• Maximal closure on a graph with resource constraints (Q1366709) (← links)
• Improving graph partitions using submodular functions. (Q1410700) (← links)
• Structure of a simple scheduling polyhedron (Q1803611) (← links)
• A unified approach to polynomially solvable cases of integer ``non-separable'' quadratic optimization (Q1897348) (← links)
• A new unifying heuristic algorithm for the undirected minimum cut problems using minimum range cut algorithms (Q1917270) (← links)
• Polynomial-time algorithms for submodular Laplacian systems (Q2235770) (← links)
• Polynomial time algorithm for an optimal stable assignment with multiple partners (Q2373720) (← links)
• Separation of partition inequalities with terminals (Q2386198) (← links)
• Network reinforcement (Q2583121) (← links)
• Graphic Submodular Function Minimization: A Graphic Approach and Applications (Q2971617) (← links)
• Fractional covers for forests and matchings (Q3315281) (← links)
• Complexity and Polynomially Solvable Special Cases of QUBO (Q5050143) (← links)
• Logical s-t Min-Cut Problem: An Extension to the Classic s-t Min-Cut Problem (Q5056912) (← links)
• Clique-connecting forest and stable set polytopes (Q5189884) (← links)
• Quantum Speedup for Graph Sparsification, Cut Approximation, and Laplacian Solving (Q5885581) (← links)
• Two‐stage stochastic minimum <i>s</i> − <i>t</i> cut problems: Formulations, complexity and decomposition algorithms (Q6087397) (← links)
• Speedup the optimization of maximal closure of a node-weighted directed acyclic graph (Q6105899) (← links)
• The rotation distance of brooms (Q6201876) (← links)