Login / Signup

Efficient Algorithms for the Prize Collecting Steiner Tree Problems with Interval Data.

Eduardo Álvarez-MirandaAlfredo Candia-VéjarXujin ChenXiaodong HuBi Li
Published in: AAIM (2010)
Keyphrases
  • interval data
  • prize collecting
  • steiner tree
  • shortest path problem
  • shortest path
  • minmax regret
  • greedy algorithm
  • travel time
  • packing problem