Pages that link to "Item:Q2689813"
From MaRDI portal
The following pages link to Multicriteria cuts and size-constrained \(k\)-cuts in hypergraphs (Q2689813):
Displaying 8 items.
- Strongly polynomial bounds for multiobjective and parametric global minimum cuts in graphs and hypergraphs (Q896272) (← links)
- Cardinality constrained and multicriteria (multi)cut problems (Q1013079) (← links)
- Hypergraph \(k\)-cut in randomized polynomial time (Q2227530) (← links)
- Generalized \(k\)-multiway cut problems (Q2504075) (← links)
- \(k\)-cuts: a variation of Gomory mixed integer cuts from the LP tableau (Q2884566) (← links)
- A new contraction technique with applications to congruency-constrained cuts (Q5918921) (← links)
- Multicriteria Cuts and Size-Constrained k-Cuts in Hypergraphs. (Q6084360) (← links)
- A polynomial time algorithm for finding a minimum 4-partition of a submodular function (Q6608049) (← links)