Strongly polynomial bounds for multiobjective and parametric global minimum cuts in graphs and hypergraphs.
Saved in:
| Title: | Strongly polynomial bounds for multiobjective and parametric global minimum cuts in graphs and hypergraphs. |
|---|---|
| Authors: | Aissi, Hassene1, aissi@lamsade.dauphine.fr, Mahjoub, A.1, mahjoub@lamsade.dauphine.fr, McCormick, S.2, tom.mccormick@sauder.ubc.ca, Queyranne, Maurice, maurice.queyranne@sauder.ubc.ca |
| Source: | Mathematical Programming; Dec2015, Vol. 154 Issue 1/2, p3-28, 26p |
| Database: | Applied Science & Technology Source |
| ISSN: | 00255610 |
|---|---|
| DOI: | 10.1007/s10107-015-0944-8 |
