A Tight Subexponential-Time Algorithm for Two-Page Book Embedding.
Robert GanianHaiko MüllerSebastian OrdyniakGiacomo PaesaniMateusz RychlickiPublished in: ICALP (2024)
Keyphrases
- times faster
- preprocessing
- learning algorithm
- worst case
- computational cost
- detection algorithm
- objective function
- optimization algorithm
- k means
- dynamic programming
- improved algorithm
- cost function
- search space
- lower bound
- significant improvement
- expectation maximization
- convergence rate
- website
- theoretical analysis
- computationally efficient
- upper bound
- simulated annealing
- computational complexity
- experimental evaluation
- optimal solution
- similarity measure
- neural network
- np hard
- recognition algorithm
- genetic algorithm