A Tight Algorithm for Strongly Connected Steiner Subgraph on Two Terminals with Demands.
Rajesh ChitnisHossein EsfandiariMohammad Taghi HajiaghayiRohit KhandekarGuy KortsarzSaeed SeddighinPublished in: Algorithmica (2017)
Keyphrases
- learning algorithm
- detection algorithm
- expectation maximization
- worst case
- preprocessing
- np hard
- objective function
- strongly connected
- computational complexity
- cost function
- experimental evaluation
- probabilistic model
- search space
- decision trees
- high accuracy
- significant improvement
- computational cost
- dynamic programming
- matching algorithm
- segmentation algorithm
- social network analysis
- recognition algorithm
- minimum spanning tree
- optimal solution