Login / Signup

Convergence to Lexicographically Optimal Base in a (Contra)Polymatroid and Applications to Densest Subgraph and Tree Packing.

Elfarouk HarbKent QuanrudChandra Chekuri
Published in: CoRR (2023)
Keyphrases
  • tree structure
  • graph mining
  • dynamic programming
  • optimal solution
  • joint replenishment
  • lower bound
  • worst case
  • binary decision tree
  • data mining
  • np hard
  • connected components
  • convergence rate
  • maximum weight