Login / Signup

Applications of the Linear Matroid Parity Algorithm to Approximating Steiner Trees.

Piotr BermanMartin FürerAlexander Zelikovsky
Published in: CSR (2006)
Keyphrases
  • cost function
  • dynamic programming
  • steiner tree
  • search space
  • objective function
  • genetic algorithm
  • computational complexity
  • simulated annealing
  • weighted graph