New Partitioning Techniques and Faster Algorithms for Approximate Interval Scheduling.
Spencer ComptonSlobodan MitrovicRonitt RubinfeldPublished in: CoRR (2020)
Keyphrases
- significant improvement
- computational cost
- data structure
- computational complexity
- recently developed
- parallel machines
- machine learning algorithms
- partitioning algorithm
- data sets
- exact and approximate
- graph partitioning
- graph theory
- times faster
- optimization problems
- special case
- information systems
- computer vision
- learning algorithm
- data mining