|
This survey paper on polynomial-time solvable versions of graph connectivity augmentation problems, and on the corresponding minimax theorems, was written in August 2001 and has not been published earlier. Some of the references have been updated but the text is unchanged. For more recent developments the reader is referred to [29,75].
Bibtex entry:
| AUTHOR | = | {Jord{\'a}n, Tibor}, |
| TITLE | = | {Minimax Theorems in Graph Connectivity Augmentation}, |
| NOTE | = | {{\tt egres.elte.hu}}, |
| INSTITUTION | = | {Egerv{\'a}ry Research Group, Budapest}, |
| YEAR | = | {2012}, |
| NUMBER | = | {TR-2012-14} |