A 5-approximation algorithm for 2D continuous dynamic time warping under the 1-norm with O(n^5) time, extendable to (5+ε) for any fixed norm.
Approximation of convex sets by polytopes
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
years
2026 2verdicts
UNVERDICTED 2representative citing papers
Proves that ℓ_p norm minimization yields p-independent Hausdorff convergence rate O(k^{2/(1-q)}) in convex vector optimization via Euclidean intermediary and norm equivalence.
citing papers explorer
-
A Constant-Factor Approximation for Continuous Dynamic Time Warping in 2D
A 5-approximation algorithm for 2D continuous dynamic time warping under the 1-norm with O(n^5) time, extendable to (5+ε) for any fixed norm.
-
Convergence Rates for $\ell_p$ Norm Minimization in Convex Vector Optimization
Proves that ℓ_p norm minimization yields p-independent Hausdorff convergence rate O(k^{2/(1-q)}) in convex vector optimization via Euclidean intermediary and norm equivalence.