10 citations · 20 across the 15 of their papers we have counts for
Showing 2018Show all
2 papers · 1 filter
cs.DS2018
Fast Modular Subset Sum using Linear Sketching
Kyriakos Axiotis, Arturs Backurs, Christos Tzamos
Given n positive integers, the Modular Subset Sum problem asks if a subset adds up to a given target t modulo a given integer m. This is a natural generalization of the Subset Sum…
cs.DS2018★ 10 cited
Capacitated Dynamic Programming: Faster Knapsack and Graph Algorithms
Kyriakos Axiotis, Christos Tzamos
One of the most fundamental problems in Computer Science is the Knapsack problem. Given a set of n items with different weights and values, it asks to pick the most valuable subset…