Randomized rounding algorithms for large scale unsplittable flow problems.
François LamotheEmmanuel RachelsonAlain HaïtCédric BaudoinJean-Baptiste DupePublished in: J. Heuristics (2021)
Keyphrases
- optimization problems
- randomized algorithms
- huge data sets
- significant improvement
- hard problems
- computationally efficient
- related problems
- test problems
- learning algorithm
- approximate solutions
- difficult problems
- benchmark problems
- search methods
- problems in computer vision
- computational problems
- data structure
- small scale
- theoretical analysis
- np complete
- simulated annealing
- exact algorithms
- theoretical guarantees
- greedy algorithms
- computational cost
- convex optimization problems
- real world
- structured prediction problems