Login / Signup

A Stronger Lower Bound on Parametric Minimum Spanning Trees.

David Eppstein
Published in: Algorithmica (2023)
Keyphrases
  • minimum spanning trees
  • lower bound
  • upper bound
  • minimum spanning tree
  • spanning tree
  • objective function
  • worst case
  • np hard
  • neighborhood graph
  • optimal solution
  • distance measure
  • graph theory
  • edge weights