Lower Bounds for Lexicographical DFS Data Structures.
Sankardeep ChakrabortyChristian EngelsPublished in: DCC (2022)
Keyphrases
- lower bound
- data structure
- upper bound
- depth first search
- branch and bound
- morphological operators
- branch and bound algorithm
- objective function
- np hard
- efficient data structures
- upper and lower bounds
- data types
- optimal solution
- worst case
- lower bounding
- vc dimension
- index structure
- quadtree
- lower and upper bounds
- randomly generated problems
- suffix tree
- optimal cost
- breadth first search
- external memory
- quadratic assignment problem
- nearest neighbor
- search algorithm
- tree search
- similarity search
- database management systems
- main memory