Strongly polynomial bounds for multiobjective and parametric global minimum cuts in graphs and hypergraphs (Q896272)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Strongly polynomial bounds for multiobjective and parametric global minimum cuts in graphs and hypergraphs |
scientific article; zbMATH DE number 6518231
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Strongly polynomial bounds for multiobjective and parametric global minimum cuts in graphs and hypergraphs |
scientific article; zbMATH DE number 6518231 |
Statements
Strongly polynomial bounds for multiobjective and parametric global minimum cuts in graphs and hypergraphs (English)
0 references
9 December 2015
0 references
multiobjective optimization
0 references
parametric optimization
0 references
global minimum cut
0 references
0 references
0.9217584133148192
0 references
0.8324163556098938
0 references
0.8302155137062073
0 references
0.8292828798294067
0 references
0.8161072731018066
0 references
