A Tight Algorithm for Strongly Connected Steiner Subgraph on Two Terminals with Demands (Extended Abstract).
Rajesh Hemant ChitnisHossein EsfandiariMohammadTaghi HajiaghayiRohit KhandekarGuy KortsarzSaeed SeddighinPublished in: IPEC (2014)
Keyphrases
- extended abstract
- worst case
- experimental evaluation
- np hard
- detection algorithm
- search space
- computational cost
- optimization algorithm
- expectation maximization
- objective function
- optimal solution
- upper bound
- dynamic programming
- learning algorithm
- matching algorithm
- tree structure
- cost function
- significant improvement
- lower bound
- preprocessing
- computational complexity
- particle swarm optimization
- markov chain
- k means
- decision trees
- genetic algorithm
- minimum spanning tree
- strongly connected