A Tight Subexponential-time Algorithm for Two-Page Book Embedding.
Robert GanianHaiko MüllerSebastian OrdyniakGiacomo PaesaniMateusz RychlickiPublished in: CoRR (2024)
Keyphrases
- dynamic programming
- learning algorithm
- worst case
- detection algorithm
- computational complexity
- preprocessing
- k means
- cost function
- optimization algorithm
- simulated annealing
- computational cost
- optimal solution
- times faster
- segmentation algorithm
- linear programming
- improved algorithm
- matching algorithm
- lower bound
- search algorithm
- objective function
- high accuracy
- probabilistic model
- np hard
- input data
- computationally efficient
- significant improvement
- tree structure
- data mining
- neural network