Minimum augmentation to tri-connect a bi-connected graph with upper bounds on vertex-degree

摘要

cup {infin} on vertex-degree increase for each v isin V, find a smallest set E' of edges such that (V,E cup E') is 3-vertex-connected and such that vertex-degree increase of each v isin V by the addition of E' to G is at most f(v), where Z