Minimum cost noncrossing flow problem on layered networks.
I. Kuban AltinelNecati ArasZeynep SuvakZ. Caner TaskinPublished in: Discret. Appl. Math. (2019)
Keyphrases
- minimum cost
- network flow problem
- queueing systems
- np hard
- approximation algorithms
- network flow
- transition probabilities
- spanning tree
- network simplex algorithm
- capacity constraints
- complex networks
- social networks
- worst case
- control problems
- optimal solution
- network structure
- social network analysis
- arrival rate
- minimal cost
- network design problem
- markov processes
- lower bound
- edit operations