Two-Commodity Flow Is Equivalent to Linear Programming Under Nearly-Linear Time Reductions.
Ming DingRasmus KyngPeng ZhangPublished in: ICALP (2022)
Keyphrases
- linear programming
- linear program
- quadratic programming
- np hard
- dynamic programming
- linear programming problems
- objective function
- constraint propagation
- real world
- primal dual
- efficient computation
- integer programming
- worst case
- computer vision
- artificial intelligence
- feasible solution
- upper bound
- information retrieval
- nonlinear programming
- neural network
- algorithm for linear programming