A node-based layered graph approach for the Steiner tree problem with revenues, budget and hop-constraints.
Markus SinnlIvana LjubicPublished in: Math. Program. Comput. (2016)
Keyphrases
- graph structure
- directed graph
- betweenness centrality
- constraint satisfaction
- steiner tree
- undirected graph
- finding the shortest path
- root node
- path length
- graph theoretic
- graph representation
- spanning tree
- minimum spanning tree
- graph theory
- connected components
- overlapping communities
- structured data
- graph databases
- graph model
- graph mining
- edge weights
- directed acyclic graph
- strongly connected
- tree structure
- destination node