A Lower Bound on the Area of Permutation Layouts.
Alok AggarwalMaria M. KlaweDavid LichtensteinNathan LinialAvi WigdersonPublished in: Algorithmica (1991)
Keyphrases
- lower bound
- upper bound
- branch and bound
- branch and bound algorithm
- objective function
- np hard
- lower and upper bounds
- optimal solution
- lower bounding
- polynomial approximation
- lagrangian relaxation
- sufficiently accurate
- upper and lower bounds
- sample complexity
- worst case
- database systems
- mathematical programming
- linear programming relaxation
- search algorithm
- genetic algorithm