Does Subset Sum Admit Short Proofs?
M Włodarczyk - arXiv preprint arXiv:2409.03526, 2024 - arxiv.org
We investigate the question whether Subset Sum can be solved by a polynomial-time
algorithm with access to a certificate of length poly (k) where k is the maximal number of bits …
algorithm with access to a certificate of length poly (k) where k is the maximal number of bits …
Single-machine scheduling to minimize the number of tardy jobs with release dates
We study the fundamental scheduling problem $1\mid r_j\mid\sum w_j U_j $: schedule a set
of $ n $ jobs with weights, processing times, release dates, and due dates on a single …
of $ n $ jobs with weights, processing times, release dates, and due dates on a single …
The Art of Staying Ahead of Deadlines: Improved Algorithms for the Minimum Tardy Processing Time
M Stoian - arXiv preprint arXiv:2402.16847, 2024 - arxiv.org
We study the fundamental scheduling problem $1\|\sum p_jU_j $. Given a set of $ n $ jobs
with processing times $ p_j $ and deadlines $ d_j $, the problem is to select a subset of jobs …
with processing times $ p_j $ and deadlines $ d_j $, the problem is to select a subset of jobs …