Faster, deterministic and space efficient subtrajectory clustering

DOI10.4230/LIPICS.ICALP.2025.133MaRDI QIDQ7397591zbMATH OpenFDO

Authors Ivor van der Hoog, Thijs van der Horst, Tim Ophelders

Publication date 2025

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.4230/LIPICS.ICALP.2025.133

Mathematics Subject Classification ID

Theory of software (68Nxx) Theory of computing (68Qxx)

Cites work

• A Greedy Heuristic for the Set-Covering Problem
• Approximating \((k,\ell)\)-center clustering for curves
• APPROXIMATING POLYGONS AND SUBDIVISIONS WITH MINIMUM-LINK PATHS
• Clustering time series under the Fréchet distance
• COMPUTING THE FRÉCHET DISTANCE BETWEEN TWO POLYGONAL CURVES
• Coresets for \((k, \ell ) \)-median clustering under the Fréchet distance
• Cubic upper and lower bounds for subtrajectory clustering under the continuous Fréchet distance
• Curve simplification and clustering under Fréchet distance
• Detecting commuting patterns by clustering subtrajectories
• Fast Fréchet queries
• Faster approximate covering of subcurves under the Fréchet distance
• scientific article; zbMATH DE number 7662168 (Why is no real title available?)
• Near-linear time approximation algorithms for curve simplification
• On graphs preserving rectilinear shortest paths in the presence of obstacles
• Reducibility among combinatorial problems

This page was built for publication: Faster, deterministic and space efficient subtrajectory clustering

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7397591)