A Quasi-Polynomial Algorithm for Submodular Tree Orienteering in Directed Graphs.
Rohan GhugeViswanath NagarajanPublished in: CoRR (2018)
Keyphrases
- objective function
- preprocessing
- directed graph
- graph structure
- detection algorithm
- probabilistic model
- learning algorithm
- minimum spanning tree
- tree structure
- expectation maximization
- computational cost
- image segmentation
- maximum flow
- worst case
- cost function
- k means
- search space
- optimal solution
- simulated annealing
- np hard
- special case
- matching algorithm
- greedy algorithm
- similarity measure
- polynomial size