Envy-freeness and relaxed stability: hardness and approximation algorithms.
Prem KrishnaaGirija LimayeMeghana NasrePrajakta NimbhorkarPublished in: J. Comb. Optim. (2023)
Keyphrases
- approximation algorithms
- np hard
- np hardness
- worst case
- optimal solution
- special case
- envy freeness
- minimum cost
- primal dual
- vertex cover
- computational complexity
- approximation ratio
- constant factor
- open shop
- upper bound
- branch and bound algorithm
- randomized algorithms
- scheduling problem
- constant factor approximation
- polynomial time approximation
- set cover
- linear programming
- lower bound
- genetic algorithm
- decision problems