A Tight Algorithm for Strongly Connected Steiner Subgraph On Two Terminals With Demands.
Rajesh Hemant ChitnisHossein EsfandiariMohammadTaghi HajiaghayiRohit KhandekarGuy KortsarzSaeed SeddighinPublished in: CoRR (2015)
Keyphrases
- optimal solution
- detection algorithm
- high accuracy
- worst case
- np hard
- dynamic programming
- optimization algorithm
- experimental evaluation
- significant improvement
- strongly connected
- particle swarm optimization
- preprocessing
- computational cost
- cost function
- segmentation algorithm
- computational complexity
- learning algorithm
- k means
- search space
- expectation maximization
- recognition algorithm
- minimum spanning tree