User:Karajimys/sandbox

The problem in which the object is to add a minimum weight set of edges to a graph so as to satisfy a given condition is called the Graph Augmentation Problem.

Two particular augmentation policies can be of more interest in practice :

• Network-Centric Policy: Graph augmentations can be applied anywhere in the network.

• Node-Centric Policy: Graph augmentations should be applied equally over all nodes in the network.