Login / Signup

Buffered Steiner trees for difficult instances.

Charles J. AlpertMilos HrkicJiang HuAndrew B. KahngJohn LillisBao LiuStephen T. QuaySachin S. SapatnekarA. J. SullivanPaul Villarrubia
Published in: ISPD (2001)
Keyphrases
  • steiner tree
  • shortest path
  • computationally expensive
  • linear programming relaxation
  • random walk
  • social network analysis