Approximation Algorithms for Disjoint Paths and Related Routing and Packing Problems.
Alok BavejaAravind SrinivasanPublished in: Math. Oper. Res. (2000)
Keyphrases
- disjoint paths
- approximation algorithms
- packing problem
- np hard
- special case
- vertex cover
- worst case
- undirected graph
- set cover
- minimum cost
- randomized algorithms
- bin packing
- directed graph
- precedence constraints
- open shop
- primal dual
- approximation ratio
- constant factor
- shortest path
- integer programming
- partial order
- multistage