Pages that link to "Item:Q896272"
From MaRDI portal
The following pages link to Strongly polynomial bounds for multiobjective and parametric global minimum cuts in graphs and hypergraphs (Q896272):
Displaying 11 items.
- An approximation algorithm for a general class of multi-parametric optimization problems (Q2082173) (← links)
- Multi-objective unconstrained combinatorial optimization: a polynomial bound on the number of extreme supported solutions (Q2423818) (← links)
- Complexity of source-sink monotone 2-parameter min cut (Q2670479) (← links)
- Multicriteria cuts and size-constrained \(k\)-cuts in hypergraphs (Q2689813) (← links)
- Minimum Cuts and Sparsification in Hypergraphs (Q4561257) (← links)
- Faster Algorithms for Next Breakpoint and Max Value for Parametric Global Minimum Cuts (Q5041732) (← links)
- Parametric Computation of Minimum-Cost Flows with Piecewise Quadratic Costs (Q5076726) (← links)
- A Strongly Polynomial Time Algorithm for Multicriteria Global Minimum Cuts (Q5418982) (← links)
- Multicriteria Cuts and Size-Constrained k-Cuts in Hypergraphs. (Q6084360) (← links)
- Deterministic enumeration of all minimum cut-sets and \(k\)-cut-sets in hypergraphs for fixed \(k\) (Q6608037) (← links)
- Approximating multiobjective optimization problems: how exact can you be? (Q6616269) (← links)
