Keyphrases
- undirected graph
- lower bound
- upper bound
- approximation algorithms
- directed graph
- np hard
- spanning tree
- directed acyclic graph
- branch and bound algorithm
- complex networks
- minimum cost
- connected components
- worst case
- transitive closure
- branch and bound
- graph structure
- objective function
- disjoint paths
- state space
- mental states
- lower and upper bounds
- optimal solution
- positive integer
- random graphs
- adjacency matrix
- sufficiently accurate
- maximum cardinality
- markov chain
- knn
- competitive ratio
- randomized algorithm
- polynomial approximation
- social networks