Randomized rounding algorithms for large scale unsplittable flow problems.
François LamotheEmmanuel RachelsonAlain HaïtCédric BaudoinJean-Baptiste DupePublished in: CoRR (2023)
Keyphrases
- optimization problems
- computational problems
- randomized algorithms
- related problems
- combinatorial optimization
- combinatorial optimization problems
- huge data sets
- run times
- data structure
- problems in computer vision
- specific problems
- theoretical analysis
- learning algorithm
- test problems
- benchmark problems
- np complete
- difficult problems
- computational geometry
- search methods
- np hard problems
- partial solutions
- exact algorithms
- evolutionary algorithm
- greedy algorithms
- computational complexity
- search algorithm
- computationally efficient