Positive correlations and buffer occupancy: Lower bound via supermodular ordering.
Sarut VanichpunArmand M. MakowskiPublished in: INFOCOM (2002)
Keyphrases
- lower bound
- upper bound
- branch and bound algorithm
- branch and bound
- positive and negative
- objective function
- optimal solution
- np hard
- worst case
- combinatorial optimization
- strongly np hard
- lower bounding
- upper and lower bounds
- lower and upper bounds
- metaheuristic
- sample complexity
- vc dimension
- data sets
- correlation analysis
- partial order
- positively correlated
- evolutionary algorithm
- sufficiently accurate