Login / Signup

A Nearly Best-Possible Approximation Algorithm for Node-Weighted Steiner Trees.

Philip N. KleinR. Ravi
Published in: J. Algorithms (1995)
Keyphrases
  • cost function
  • dynamic programming
  • np hard
  • tree structure
  • objective function
  • optimal solution
  • minimum spanning tree
  • lower bound
  • segmentation algorithm
  • lead time
  • graph structure
  • packing problem
  • steiner tree