A $3+\varOmega (1)$ Lower Bound for Page Migration.
Akira MatsubayashiPublished in: Algorithmica (2020)
Keyphrases
- lower bound
- upper bound
- website
- branch and bound algorithm
- branch and bound
- web pages
- objective function
- lower and upper bounds
- np hard
- optimal solution
- lower bounding
- sufficiently accurate
- page layout
- upper and lower bounds
- computational complexity
- worst case
- web graph
- link structure
- lagrangian relaxation
- linear programming relaxation
- search engine
- buffer size
- branch and bound method
- polynomial approximation
- neural network
- data sets