Minimizing tardy processing time on a single machine in near-linear time
From MaRDI portal
Cites work
- A Functional Equation and its Application to Resource Allocation and Sequencing Problems
- A near-linear pseudopolynomial time algorithm for subset sum
- A simple near-linear pseudopolynomial time randomized algorithm for subset sum
- Capacitated dynamic programming: faster knapsack and graph algorithms
- Dynamic suffix array with polylogarithmic queries and updates
- Fast algorithms for knapsack via convolution and prediction
- Fast and simple modular subset sum
- Fast modular subset sum using linear sketching
- Faster 0-1-knapsack via near-convex min-plus-convolution
- Faster algorithms for \(k\)-subset sum and variations
- Faster algorithms for bounded knapsack and bounded subset sum via fine-grained proximity results
- Faster knapsack algorithms via bounded monotone min-plus-convolution
- Faster minimization of tardy processing time on a single machine
- Faster Pseudopolynomial Time Algorithms for Subset Sum
- scientific article; zbMATH DE number 6850408 (Why is no real title available?)
- scientific article; zbMATH DE number 1445383 (Why is no real title available?)
- scientific article; zbMATH DE number 7204473 (Why is no real title available?)
- scientific article; zbMATH DE number 7740931 (Why is no real title available?)
- scientific article; zbMATH DE number 7788445 (Why is no real title available?)
- Maintaining dynamic sequences under equality tests in polylogarithmic time
- Modular subset sum, dynamic strings, and zero-sum sets
- More on change-making and related problems
- New pseudopolynomial complexity bounds for the bounded and other integer knapsack related problems
- On Integer Programming, Discrepancy, and Convolution
- On minimizing tardy processing time, Max-Min skewed convolution, and triangular structured ILPs
- On problems as hard as CNF-SAT
- On problems equivalent to \((\min,+)\)-convolution
- On problems related to unbounded SubsetSum: a unified combinatorial approach
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Proximity Results and Faster Algorithms for Integer Programming Using the Steinitz Lemma
- Quick minimization of tardy processing time on a single machine
- SETH-based lower bounds for subset sum and bicriteria path
- Unique Binary-Search-Tree Representations and Equality Testing of Sets and Sequences
Cited in
(3)
This page was built for publication: Minimizing tardy processing time on a single machine in near-linear time
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6875135)
