Lucas Meijer

activity

20222026

most cited3-Coloring in Time O(1.3217^n)

1 citations · 1 across the 7 of their papers we have counts for

collaborators

Showing 2023Show all

2 papers · 1 filter

cs.CG2023

Clustering with Few Disks to Minimize the Sum of Radii

Mikkel Abrahamsen, Sarita de Berg, Lucas Meijer +2

Given a set of $n$ points in the Euclidean plane, the $k$ -MinSumRadius problem asks to cover this point set using $k$ disks with the objective of minimizing the sum of the radii of…

cs.DS2023★ 1 cited

3-Coloring in Time O(1.3217^n)

Lucas Meijer

We propose a new algorithm for 3-coloring that runs in time O(1.3217^n). For this algorithm, we make use of the time O(1.3289^n) algorithm for 3-coloring by Beigel and Eppstein. Th…