The NP-Completeness of Steiner Tree and Dominating Set for Chordal Bipartite Graphs.
Haiko MüllerAndreas BrandstädtPublished in: Theor. Comput. Sci. (1987)
Keyphrases
- bipartite graph
- dominating set
- steiner tree
- facility location problem
- facility location
- connected dominating set
- undirected graph
- minimum spanning tree
- maximum matching
- network design
- integer programming
- shortest path
- link prediction
- edge weights
- multi criteria
- mixed integer
- lagrangian relaxation
- linear programming relaxation
- upper bound
- genetic algorithm
- dynamic systems
- multistage