Related papers: Pseudopolynomial algorithm for single machine sche…
The paper has been withdrawn
This note provides a simple example demonstrating that, if exact computations are allowed, the number of iterations required for the value iteration algorithm to find an optimal policy for discounted dynamic programming problems may grow…
Machine unlearning (MU) aims to remove the influence of certain data points from a trained model without costly retraining. Most practical MU algorithms are only approximate and their performance can only be assessed empirically. Care must…
This paper has been withdrawn by the author due to a crucial sign error in equation 1
This paper has been withdrawn by the author because it has been substantially modified.
This paper has been withdrawn.
This paper has been withdrawn.
We consider the problem of planning with participation constraints introduced in [Zhang et al., 2022]. In this problem, a principal chooses actions in a Markov decision process, resulting in separate utilities for the principal and the…
The paper is withdrawn because the analysis appeared to be incomplete.
This paper has been withdrawn by the author due a few mistakes in the paper.
In order to verify programs or hybrid systems, one often needs to prove that certain formulas are unsatisfiable. In this paper, we consider conjunctions of polynomial inequalities over the reals. Classical algorithms for deciding these not…
The paper is withdrawn. The proof has an error and it requires a different approach.
This paper has been withdrawn, as all conjectures (and one claim) have been proven incorrect. Some of what remains may eventually reappear in a different context.
We investigate the recoverable robust single machine scheduling problem under interval uncertainty. In this setting, jobs have first-stage processing times p and second-stage processing times q and we aim to find a first-stage and…
The paper is withdrawn by the author due to an oversimplified and misleading approach which was taken initially as a starting point.
The paper has been withdrawn by the author due to unhappy mistake in the initial scope of the work.
This paper has been withdrawn by the author due to a crucial problem in Lemma 3. This equation must be changed.
Paper is withdrawn. On review the paper contributes little of significance. The runtime analysis of the algorithms presented, while correct in terms of number of operations, does not represent the complexity of the algorithms in terms of…
In this work we revisit the elementary scheduling problem $1||\sum p_j U_j$. The goal is to select, among $n$ jobs with processing times and due dates, a subset of jobs with maximum total processing time that can be scheduled in sequence…
This paper has been withdrawn by the authors, due a crucial error.