Login / Signup

Edge disjoint Steiner trees in graphs without large bridges.

Matthias Kriesell
Published in: J. Graph Theory (2009)
Keyphrases
  • spanning tree
  • minimum spanning tree
  • edge disjoint
  • steiner tree
  • minimum cost
  • undirected graph
  • weighted graph
  • edge weights
  • genetic algorithm
  • shortest path
  • facility location