Approximation Algorithms for Maximum Weighted Throughput on Unrelated Machines.
George KarakostasStavros G. KolliopoulosPublished in: APPROX/RANDOM (2023)
Keyphrases
- approximation ratio
- approximation algorithms
- np hard
- special case
- response time
- worst case
- vertex cover
- facility location problem
- network design problem
- minimum cost
- primal dual
- constant factor
- approximation guarantees
- np hardness
- set cover
- total weight
- open shop
- approximation schemes
- integrality gap
- disjoint paths
- combinatorial auctions
- randomized algorithms
- constant factor approximation
- metaheuristic
- greedy algorithm
- knapsack problem
- flowshop
- undirected graph
- weighted sum