Pages that link to "Item:Q5204331"
From MaRDI portal
The following pages link to Suboptimal cuts: Their enumeration, weight and number (Q5204331):
Displaying 11 items.
- Strongly polynomial bounds for multiobjective and parametric global minimum cuts in graphs and hypergraphs (Q896272) (← links)
- Most balanced minimum cuts (Q968139) (← links)
- Beating the 2-approximation factor for global bicut (Q2316621) (← links)
- Improving on best-of-many-Christofides for \(T\)-tours (Q2661569) (← links)
- Efficient Algorithms for the k Smallest Cuts Enumeration (Q3511355) (← links)
- The Complexity of Boolean Surjective General-Valued CSPs (Q5111218) (← links)
- Must the communication graph of MPC protocols be an expander? (Q6110384) (← links)
- On the minimum \(s-t\) cut problem with budget constraints (Q6120941) (← links)
- Deterministic enumeration of all minimum cut-sets and \(k\)-cut-sets in hypergraphs for fixed \(k\) (Q6608037) (← links)
- A polynomial time algorithm for finding a minimum 4-partition of a submodular function (Q6608049) (← links)
- Efficient constant-factor approximate enumeration of minimal subsets for monotone properties with weight constraints (Q6657233) (← links)
