Tight Approximation Algorithms for p-Mean Welfare Under Subadditive Valuations.
Siddharth BarmanUmang BhaskarAnand KrishnaRanjani G. SundaramPublished in: CoRR (2020)
Keyphrases
- approximation algorithms
- worst case
- combinatorial auctions
- np hard
- lower bound
- special case
- upper bound
- vertex cover
- minimum cost
- facility location problem
- primal dual
- approximation ratio
- network design problem
- set cover
- undirected graph
- np hardness
- randomized algorithms
- mixed integer
- open shop
- linear programming
- approximation schemes
- exact algorithms
- winner determination
- constant factor approximation
- genetic algorithm
- constant factor
- precedence constraints
- mechanism design
- scheduling problem