Ernest van Wijland

most citedFaster Approximation Scheme for Euclidean

k

-TSP

2 citations · 2 across the 4 of their papers we have counts for

collaborators

4 papers

cs.CL2026

TCS-BENCH: Benchmarking State-of-the-Art Generative AI Theoretical Computer Science Research Ability

Vincent Cohen-Addad, Dimitris Paparas, Ernest van Wijland +13

We introduce TCS-Bench, a benchmark for evaluating Large Language Models (LLMs) on research-level Theoretical Computer Science (TCS) proof generation. TCS-Bench consists of theorem…

cs.DS2026

Spectral Dual Fitting for $k$ -Means

Aditya Anand, Moses Charikar, Vincent Cohen-Addad +5

We give a new dual fitting algorithm which gives improved approximation ratios of $3 + ln 2 + ε (\approx 3.694)$ and $4.9 + ε$ for $k$ -Means in (high-dimensional) Euclidean and genera…

cs.DS2026

An Improved Greedy Approximation for (Metric) $k$ -Means

Moses Charikar, Vincent Cohen-Addad, Ruiquan Gao +3

Clustering is a basic task in data analysis and machine learning, and the optimization of clustering objectives are well-studied optimization problems; amongst these, the $k$ -Means…

cs.CG2023★ 2 cited

Faster Approximation Scheme for Euclidean $k$ -TSP

Ernest van Wijland, Hang Zhou

In the Euclidean $k$ -traveling salesman problem ( $k$ -TSP), we are given $n$ points in the $d$ -dimensional Euclidean space, for some fixed constant $d \geq 2$ , and a positive integer…

TCS-BENCH: Benchmarking State-of-the-Art Generative AI Theoretical Computer Science Research Ability

Spectral Dual Fitting for k-Means

An Improved Greedy Approximation for (Metric) k-Means

Faster Approximation Scheme for Euclidean k-TSP

Spectral Dual Fitting for $k$ -Means

An Improved Greedy Approximation for (Metric) $k$ -Means

Faster Approximation Scheme for Euclidean $k$ -TSP