Graph Coarsening for Runtime Improvements in the Maximum Concurrent Flow Problem

2018 AIAA Information Systems-AIAA Infotech @ Aerospace ◽

10.2514/6.2018-0468 ◽

2018 ◽

Author(s):

Fernando E. Vilas ◽

Eli Olinick ◽

David Matula

Keyword(s):

Flow Problem ◽

Concurrent Flow ◽

Graph Coarsening ◽

Maximum Concurrent Flow

Download Full-text

Efficient algorithms for the maximum concurrent flow problem

Networks ◽

10.1002/net.21572 ◽

2014 ◽

Vol 65 (1) ◽

pp. 56-67 ◽

Author(s):

Pierre-Olivier Bauguion ◽

Walid Ben-Ameur ◽

Eric Gourdin

Keyword(s):

Flow Problem ◽

Efficient Algorithms ◽

Concurrent Flow ◽

Maximum Concurrent Flow

Download Full-text

Asymptotic analysis of the flow deviation method for the maximum concurrent flow problem

Mathematical Programming ◽

10.1007/s101070100254 ◽

2002 ◽

Vol 91 (3) ◽

pp. 479-492 ◽

Author(s):

Daniel Bienstock ◽

Olga Raskina

Keyword(s):

Asymptotic Analysis ◽

Flow Problem ◽

Concurrent Flow ◽

Flow Deviation ◽

Deviation Method ◽

Maximum Concurrent Flow

Download Full-text

Faster approximation algorithm for generalized maximum concurrent flow problem with budget constraint

2008 IEEE International Conference on Service Operations and Logistics, and Informatics ◽

10.1109/soli.2008.4686579 ◽

2008 ◽

Author(s):

Liwei Dong ◽

Liying Bian ◽

Hengyong Tang

Keyword(s):

Approximation Algorithm ◽

Flow Problem ◽

Budget Constraint ◽

Concurrent Flow ◽

Maximum Concurrent Flow

Download Full-text

The maximum concurrent flow problem

Journal of the ACM ◽

10.1145/77600.77620 ◽

1990 ◽

Vol 37 (2) ◽

pp. 318-334 ◽

Author(s):

Farhad Shahrokhi ◽

D. W. Matula

Keyword(s):

Flow Problem ◽

Concurrent Flow ◽

Maximum Concurrent Flow

Download Full-text

Approximation Algorithms for the Maximum Concurrent Flow Problem

INFORMS Journal on Computing ◽

10.1287/ijoc.1.2.62 ◽

1989 ◽

Vol 1 (2) ◽

pp. 62-69 ◽

Author(s):

Farhad Shahrokhi

Keyword(s):

Approximation Algorithms ◽

Flow Problem ◽

Concurrent Flow ◽

Maximum Concurrent Flow

Download Full-text

Maximum Concurrent Flow Problem in MPLS-Based Software Defined Networks

2018 IEEE Global Communications Conference (GLOBECOM) ◽

10.1109/glocom.2018.8648112 ◽

2018 ◽

Author(s):

Tzu-Wen Chang ◽

Yao-Jen Tang ◽

Yu-Shu Chen ◽

Wei-Han Hsu ◽

Ming-Jer Tsai

Keyword(s):

Flow Problem ◽

Software Defined Networks ◽

Concurrent Flow ◽

Maximum Concurrent Flow

Download Full-text

Faster approximation algorithm for generalised maximum concurrent flow problem in networks with no flow-generating cycles

International Journal of Services Operations and Informatics ◽

10.1504/ijsoi.2010.031046 ◽

2010 ◽

Vol 5 (1) ◽

pp. 20 ◽

Author(s):

Liwei Dong ◽

Hong Wang ◽

Xiaofen Zhang

Keyword(s):

Approximation Algorithm ◽

Flow Problem ◽

Concurrent Flow ◽

Maximum Concurrent Flow

Download Full-text

A O(nm) Heuristic to the Hierarchical Maximum Concurrent Flow Problem

AIAA Information Systems-AIAA Infotech @ Aerospace ◽

10.2514/6.2017-0880 ◽

2017 ◽

Author(s):

Fernando E. Vilas ◽

Eli Olinick ◽

David Matula

Keyword(s):

Flow Problem ◽

Concurrent Flow ◽

Maximum Concurrent Flow

Download Full-text

An Improved Flow Deviation Method for the Maximum Concurrent Flow Problem

2020 IEEE 4th Information Technology, Networking, Electronic and Automation Control Conference (ITNEC) ◽

10.1109/itnec48623.2020.9085047 ◽

2020 ◽

Author(s):

Yanxiang Chen ◽

Yu Zhang ◽

Mengze Yuan

Keyword(s):

Flow Problem ◽

Concurrent Flow ◽

Flow Deviation ◽

Deviation Method ◽

Maximum Concurrent Flow

Download Full-text

An efficient flow routing algorithm to solve the maximum concurrent flow problem with applications to the packed switched telecommunication networks and cluster analysis (abstract)

Proceedings of the 1986 ACM fourteenth annual conference on Computer science - CSC '86 ◽

10.1145/324634.325329 ◽

1986 ◽

Author(s):

Farhad Shahrokhi

Keyword(s):

Cluster Analysis ◽

Flow Problem ◽

Routing Algorithm ◽

Telecommunication Networks ◽

Flow Routing ◽

Concurrent Flow ◽

And Cluster Analysis ◽

Maximum Concurrent Flow

Download Full-text