scientific article; zbMATH DE number 7662168
From MaRDI portal
Publication:5881551
DOI10.57717/cgt.v2i1.7MaRDI QIDQ5881551
Anne Driemel, Hugo A. Akitaya, Unnamed Author, Erin Wolf Chambers
Publication date: 10 March 2023
Full work available at URL: https://arxiv.org/abs/2103.06040
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Near-linear time approximation algorithms for curve simplification
- \(\epsilon\)-nets and simplex range queries
- Almost optimal set covers in finite VC-dimension
- Near-linear algorithms for geometric hitting sets and set covers
- The VC dimension of metric balls under Fréchet and Hausdorff distances
- DETECTING COMMUTING PATTERNS BY CLUSTERING SUBTRAJECTORIES
- Optimal Binary Space Partitions in the Plane
- A Greedy Heuristic for the Set-Covering Problem
- Las Vegas algorithms for linear and integer programming when the dimension is small
- Clustering time series under the Fréchet distance
- COMPUTING THE FRÉCHET DISTANCE BETWEEN TWO POLYGONAL CURVES
- Approximation algorithms for projective clustering
- Neural Network Learning
- Algorithms for polytope covering and approximation
- Flattening Fixed-Angle Chains Is Strongly NP-Hard
- Approximating (k, ℓ)-center clustering for curves
- A randomized art-gallery algorithm for sensor placement
This page was built for publication:
