New approximation algorithms for the heterogeneous weighted delivery problem.
Davide BilòLuciano GualàStefano LeucciGuido ProiettiMirko RossiPublished in: Theor. Comput. Sci. (2022)
Keyphrases
- approximation algorithms
- np hard
- special case
- worst case
- minimum cost
- vertex cover
- facility location problem
- primal dual
- network design problem
- approximation ratio
- weighted sum
- exact algorithms
- open shop
- set cover
- approximation schemes
- constant factor
- np hardness
- precedence constraints
- undirected graph
- polynomial time approximation
- objective function
- disjoint paths
- weighted graph
- theoretical analysis
- search space