Hardness and Approximation for the Star β-Hub Routing Cost Problem in $\varDelta _\beta $-Metric Graphs.
Meng-Shiou TsaiSun-Yuan HsiehLing-Ju HungPublished in: COCOON (1) (2023)
Keyphrases
- maximum common subgraph
- shortest path
- graph matching
- finding the shortest path
- graph theoretic
- routing problem
- routing decisions
- total cost
- weighted graph
- series parallel
- graph databases
- computational complexity
- graph theory
- routing algorithm
- learning theory
- phase transition
- cost sensitive
- random graphs
- graphical models