Poly-logarithmic Approximation for Maximum Node Disjoint Paths with Constant Congestion.
Chandra ChekuriAlina EnePublished in: SODA (2013)
Keyphrases
- disjoint paths
- approximation algorithms
- worst case
- constant factor
- directed graph
- undirected graph
- special case
- np hard
- absolute error
- closed form
- error bounds
- packet transmission
- relative error
- minimum cost
- maximum number
- random walk
- bayesian networks
- ip networks
- end to end
- congestion control
- steady state
- upper bound
- optimal solution