Fair-by-design algorithms: matching problems and beyond.
David García-SorianoFrancesco BonchiPublished in: CoRR (2018)
Keyphrases
- optimization problems
- learning algorithm
- computational problems
- difficult problems
- benchmark problems
- problems in computer vision
- practical problems
- hard problems
- np complete
- search methods
- test problems
- computational complexity
- related problems
- greedy algorithms
- linear programming
- theoretical analysis
- np hard problems
- theoretical guarantees
- iterative algorithms
- design process
- computationally hard
- efficient implementation
- metaheuristic
- simulated annealing
- worst case
- computational cost
- significant improvement
- search algorithm
- data structure
- optimal solution
- face recognition
- case study
- computer vision