Relaxing the Irrevocability Requirement for Online Graph Algorithms.
Joan BoyarLene M. FavrholdtMichal KotrbcíkKim S. LarsenPublished in: Algorithmica (2022)
Keyphrases
- graph theory
- times faster
- online algorithms
- real time
- partitioning algorithm
- data mining
- significant improvement
- optimization problems
- online learning
- random walk
- computationally efficient
- combinatorial optimization
- polynomial time complexity
- graph data
- benchmark datasets
- machine learning algorithms
- np complete
- genetic algorithm