Login / Signup

An efficiently solvable case of the minimum weight equivalent subgraph problem.

Michael B. RicheyR. Gary ParkerRonald L. Rardin
Published in: Networks (1985)
Keyphrases
  • minimum weight
  • maximum weight
  • np hard
  • bipartite graph
  • greedy heuristic
  • spanning tree
  • special case
  • knapsack problem
  • minimum spanning tree
  • social networks
  • multi class
  • approximation algorithms