Multi Purpose Routing: New Perspectives and Approximation Algorithms.
Majid FarhadiJai MoondraPrasad TetaliAlejandro TorielloPublished in: CoRR (2022)
Keyphrases
- approximation algorithms
- np hard
- special case
- vertex cover
- network design problem
- primal dual
- constant factor
- facility location problem
- minimum cost
- precedence constraints
- np hardness
- worst case
- open shop
- approximation ratio
- set cover
- approximation schemes
- routing protocol
- randomized algorithms
- disjoint paths
- genetic algorithm
- routing algorithm
- greedy algorithm
- shortest path
- upper bound