A Lower Bound Technique for Nondeterministic Graph-Driven Read-Once-Branching Programs and Its Applications.
Beate BolligPhilipp WoelfelPublished in: Theory Comput. Syst. (2005)
Keyphrases
- lower bound
- upper bound
- max sat
- np hard
- lower and upper bounds
- branch and bound algorithm
- graph structure
- random walk
- graph representation
- objective function
- constant factor
- graph theory
- optimal solution
- graph model
- branch and bound
- network flow
- sufficiently accurate
- network flow formulation
- graph mining
- directed graph
- linear programming relaxation
- worst case