Integer Network Synthesis Problem for Hop Constrained Flows

Hop constraint is associated with modern communication network flows. We consider the problem of designing an optimal undirected network with integer-valued edge-capacities that meets a given set of single-commodity, hop-constrained network flow value requirements. We present a strongly polynomial, combinatorial algorithm for the problem with value of hop-parameter equal to three when values of flow … Read more