An Approximation Algorithm for the Two-Node-Connected Star Problem with Steiner Nodes.
Graciela FerreiraFranco RobledoPablo RomeroPublished in: Electron. Notes Discret. Math. (2018)
Keyphrases
- graph structure
- worst case
- learning algorithm
- computational complexity
- closed form
- dynamic programming
- undirected graph
- optimal solution
- probabilistic model
- tree structure
- detection algorithm
- np hard
- influence spread
- approximation ratio
- matching algorithm
- simulated annealing
- cost function
- expectation maximization
- directed graph
- greedy algorithm
- objective function
- similarity measure
- optimal path
- image segmentation
- root node
- genetic algorithm