Improved approximation algorithms for the multi-commodity flow problem and local competitive routing in dynamic networks

1994 ◽  
Author(s):  
Baruch Awerbuch ◽  
Tom Leighton
Keyword(s):  
Approximation Algorithms ◽  
Flow Problem ◽  
Dynamic Networks ◽  
Commodity Flow

scholarly journals Approximate Algorithms for Continuous-Time Quickest Multi-Commodity Contraflow Problem

2020 ◽  
Vol 37 (1-2) ◽  
pp. 30-46
Author(s):  
Shiva Prakash Gupta ◽  
Durga Prasad Khanal ◽  
Urmila Pyakurel ◽  
Tanka Nath Dhamala
Keyword(s):  
Approximation Algorithms ◽  
Polynomial Time ◽  
Continuous Time ◽  
Flow Problem ◽  
Capacity Constraints ◽  
Approximate Algorithms ◽  
Optimal Solutions ◽  
Commodity Flow ◽  
Flow Problems

Multi-commodity flow problem appears when several distinct commodities are shipped from supply nodes to the demand nodes through a network without violating the capacity constraints. The quickest multi-commodity flow problem deals with the minimization of time satisfying given demand. Ingeneral, the quickest multi-commodity flow problems are computationally hard. The outbound lane capacities can be increased through reverting the orientation of lanes towards the demand nodes. We present two approximation algorithms by introducing partial contraow technique in the continuous-time quick estmulti-commodity ow problem: one polynomial-time with the help of length-bounded flow and another FPTAS by using _-condensed time-expanded graph. Both algorithms reverse only necessary arc capacities to get the optimal solutions and save unused arc capacities which may be used for other purposes.   

scholarly journals A Multi-Commodity Flow Problem for Fair Resource Allocation in Multi-Path Video Delivery Networks

2020 ◽  
Vol 53 (2) ◽  
pp. 7386-7391
Author(s):  
Luca De Cicco ◽  
Gioacchino Manfredi ◽  
Vittorio Palmisano ◽  
Saverio Mascolo
Keyword(s):  
Resource Allocation ◽  
Flow Problem ◽  
Video Delivery ◽  
Commodity Flow ◽  
Delivery Networks

On the integral plane two-commodity flow problem

1992 ◽  
Vol 11 (3) ◽  
pp. 135-139 ◽  
Author(s):  
Frieda Granot ◽  
Michal Penn
Keyword(s):  
Flow Problem ◽  
Commodity Flow ◽  
Integral Plane

scholarly journals Multi-Agent Path Finding with Deadlines

2018 ◽  
Author(s):  
Hang Ma ◽  
Glenn Wagner ◽  
Ariel Felner ◽  
Jiaoyang Li ◽  
T. K. Satish Kumar ◽  
...  
Keyword(s):  
Flow Problem ◽  
Search Algorithms ◽  
The Other ◽  
Path Finding ◽  
Combinatorial Search ◽  
Programming Formulation ◽  
Commodity Flow ◽  
Linear Programming Formulation ◽  
Multi Agent ◽  
Integer Linear Programming Formulation

We formalize Multi-Agent Path Finding with Deadlines (MAPF-DL). The objective is to maximize the number of agents that can reach their given goal vertices from their given start vertices within the deadline, without colliding with each other. We first show that MAPF-DL is NP-hard to solve optimally. We then present two classes of optimal algorithms, one based on a reduction of MAPF-DL to a flow problem and a subsequent compact integer linear programming formulation of the resulting reduced abstracted multi-commodity flow network and the other one based on novel combinatorial search algorithms. Our empirical results demonstrate that these MAPF-DL solvers scale well and each one dominates the other ones in different scenarios.

scholarly journals Approximation Algorithms for the Unsplittable Flow Problem

Algorithmica ◽  
2006 ◽  
Vol 47 (1) ◽  
pp. 53-78 ◽  
Author(s):  
Amit Chakrabarti ◽  
Chandra Chekuri ◽  
Anupam Gupta ◽  
Amit Kumar
Keyword(s):  
Approximation Algorithms ◽  
Flow Problem ◽  
Unsplittable Flow
Sign in / Sign up

Export Citation Format

Share Document