Login / Signup

Fully Dynamic Algorithm for the Steiner Tree Problem in Planar Graphs.

Hemraj RaikwarSushanta Karmakar
Published in: CANDARW (2022)
Keyphrases
  • computational complexity
  • np hard
  • worst case
  • minimum spanning tree
  • optimal solution
  • k means
  • dynamic programming
  • probabilistic model
  • expectation maximization
  • piecewise linear
  • spanning tree
  • planar graphs