Login / Signup

Almost-Linear Time Algorithms for Decremental Graphs: Min-Cost Flow and More via Duality.

Jan van den BrandLi ChenRasmus KyngYang P. LiuSimon MeierhansMaximilian Probst GutenbergSushant Sachdeva
Published in: CoRR (2024)
Keyphrases
  • min cost
  • max flow
  • network flow
  • combinatorial optimization problems
  • worst case
  • linear programming
  • orders of magnitude
  • special case