research
∙
08/22/2023
Simple and Faster Algorithms for Knapsack
In this paper, we obtain a number of new simple pseudo-polynomial time a...
share
research
∙
08/20/2023
Improved Algorithms for Integer Complexity
The integer complexity f(n) of a positive integer n is defined as the mi...
research
∙
05/22/2023
Logical Entity Representation in Knowledge-Graphs for Differentiable Rule Learning
Probabilistic logical rule learning has shown great strength in logical ...
research
∙
05/03/2023
On the Fine-Grained Complexity of Small-Size Geometric Set Cover and Discrete k-Center for Small k
We study the time complexity of the discrete k-center problem and relate...
research
∙
11/01/2021
Dynamic Geometric Set Cover, Revisited
Geometric set cover is a classical problem in computational geometry, wh...
research
∙
10/06/2021
More on Change-Making and Related Problems
Given a set of n integer-valued coin types and a target value t, the wel...
research
∙
03/14/2021
More Dynamic Data Structures for Geometric Set Cover with Sublinear Update Time
We study geometric set cover problems in dynamic settings, allowing inse...
research
∙
03/26/2020
Faster Approximation Algorithms for Geometric Set Cover
We improve the running times of O(1)-approximation algorithms for the se...
research
∙
03/25/2020
Further Results on Colored Range Searching
We present a number of new results about range searching for colored (or...
research
∙
12/04/2017