48 citations · 48 across the 2 of their papers we have counts for
4 papers
Fast Exact k-Means, k-Medians and Bregman Divergence Clustering in 1D
Allan Grønlund, Kasper Green Larsen, Alexander Mathiasen +3
The -Means clustering problem on points is NP-Hard for any dimension , however, for the 1D case there exists exact polynomial time algorithms. Previous literature re…
Data Structure Lower Bounds for Document Indexing Problems
Peyman Afshani, Jesper Sindahl Nielsen
We study data structure problems related to document indexing and pattern matching queries and our main contribution is to show that the pointer machine model of computation can be…
Applications of incidence bounds in point covering problems
Peyman Afshani, Edvin Berglin, Ingo van Duijn +1
In the Line Cover problem a set of n points is given and the task is to cover the points using either the minimum number of lines or at most k lines. In Curve Cover, a generalizati…
Strictly Implicit Priority Queues: On the Number of Moves and Worst-Case Time
Gerth Stølting Brodal, Jesper Sindahl Nielsen, Jakob Truelsen
The binary heap of Williams (1964) is a simple priority queue characterized by only storing an array containing the elements and the number of elements - here denoted a strictl…