An Improved Approximation Algorithm for Dynamic Minimum Linear Arrangement.
Marcin BienkowskiGuy EvenPublished in: STACS (2024)
Keyphrases
- learning algorithm
- improved algorithm
- matching algorithm
- linear complexity
- cost function
- np hard
- optimal solution
- computational complexity
- closed form
- dynamic programming
- experimental evaluation
- decision trees
- theoretical analysis
- significant improvement
- high accuracy
- k means
- optimization algorithm
- constant factor
- approximation ratio
- times faster
- error bounds
- error tolerance
- linear approximation
- preprocessing
- recognition algorithm
- approximation algorithms
- convex hull
- special case
- detection algorithm
- computational cost
- expectation maximization