α-approximate Reductions: a Novel Source of Heuristics for Better Approximation Algorithms.
Fredrik ManneGeevarghese PhilipSaket SaurabhPrafullkumar TalePublished in: CoRR (2021)
Keyphrases
- approximation algorithms
- exact algorithms
- np hard
- special case
- approximation schemes
- vertex cover
- worst case
- open shop
- primal dual
- minimum cost
- facility location problem
- randomized algorithms
- greedy heuristic
- np hardness
- approximation ratio
- search algorithm
- precedence constraints
- undirected graph
- constant factor
- approximation guarantees
- polynomial time approximation
- combinatorial auctions
- integer programming