Karol Węgrzycki

most citedFaster Deterministic Modular Subset Sum

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

collaborators

2 papers

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…

cs.DS2020★ 4 cited

Faster Deterministic Modular Subset Sum

Krzysztof Potępa

We consider the Modular Subset Sum problem: given a multiset $X$ of integers from $Z_{m}$ and a target integer $t$ , decide if there exists a subset of $X$ with a sum equal t…

Faster Approximation Scheme for Euclidean k-TSP

Faster Deterministic Modular Subset Sum

Faster Approximation Scheme for Euclidean $k$ -TSP