Nearly-Linear Time LP Solvers and Rounding Algorithms for Scheduling Problems.

Published in: ICALP (2023)

Keyphrases

scheduling problem
linear programming
learning algorithm
worst case
linear program
data structure
lower bound
significant improvement
computational cost
approximation algorithms
optimal solution
computational complexity
upper bound
optimization problems
computationally efficient
theoretical analysis