Any vertex v a V not in F and any edge e a E not incident to a vertex in F remain unchanged in V and E, respectively. ... The traditional maximum flow algorithms such as Ford-Fulkerson and Push-Relabel cannot solve the maximum flow with LCC problem. We first formulate the problem as a linear program and then propose an algorithm for it based on Lagrangian relaxation and existing algorithms foranbsp;...
|Title||:||Quality of Service – IWQoS 2005|
|Author||:||Hermann de Meer, Nina Bhatti|
|Publisher||:||Springer - 2007-05-22|