Rooted Maximum Weight Connected Subgraphs with Balancing and Capacity Constraints.
Ralf BorndörferStephan SchwartzWilliam SurauPublished in: INOC (2022)
Keyphrases
- capacity constraints
- maximum weight
- connected subgraphs
- minimum cost
- network flow
- bipartite graph
- minimum weight
- np hard
- biological networks
- directed acyclic graph
- partial order
- spanning tree
- weighted graph
- lagrangian relaxation
- single item
- link prediction
- bicriteria
- connected components
- approximation algorithms
- bayesian networks
- binary images
- graphical models
- upper bound
- data model
- objective function