Login / Signup

Reduction techniques for the prize collecting Steiner tree problem and the maximum-weight connected subgraph problem.

Daniel RehfeldtThorsten KochStephen J. Maher
Published in: Networks (2019)
Keyphrases
  • prize collecting
  • maximum weight
  • bipartite matching
  • minimum weight
  • partial order
  • bipartite graph
  • independent set
  • weighted graph
  • travel time
  • np hard
  • dynamic programming
  • connected components