Image de couverture de livre

The Art of Staying Ahead of Deadlines: Improved Algorithms for the Minimum Tardy Processing Time

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteur principal:	Stoian, Mihail
Format:	Preprint
Publié:	2024
Sujets:	Data Structures and Algorithms Computational Complexity
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

TSP Escapes the $O(2^n n^2)$ Curse
par: Stoian, Mihail
Publié: (2024)

Minimizing the Weighted Number of Tardy Jobs is W[1]-hard
par: Heeger, Klaus, et autres
Publié: (2024)

Novel Complexity Results for Temporal Separators with Deadlines
par: Dondi, Riccardo, et autres
Publié: (2025)

Pseudodeterministic Algorithms for Minimum Cut Problems
par: Agarwala, Aryan, et autres
Publié: (2025)

Improved Hardness and Approximations for Cardinality-Based Minimum $s$-$t$ Cuts Problems in Hypergraphs
par: Adriaens, Florian, et autres
Publié: (2024)

Improved Algorithm for Permutation Testing
par: Zhang, Xiaojin
Publié: (2020)

Minimum Stable Cut and Treewidth
par: Lampis, Michael
Publié: (2021)

Did Fourier Really Meet Möbius? Fast Subset Convolution via FFT
par: Stoian, Mihail
Publié: (2024)

Approximate Min-Sum Subset Convolution
par: Stoian, Mihail
Publié: (2024)

Mind the Gap. Doubling Constant Parametrization of Weighted Problems: TSP, Max-Cut, and More
par: Stoian, Mihail
Publié: (2026)

On the Inapproximability of Finding Minimum Monitoring Edge-Geodetic Sets
par: Bilò, Davide, et autres
Publié: (2024)

Fast Leaf-to-Ancestor Minimum Query in the Oracle Model
par: Upirvitskiy, Aleksey, et autres
Publié: (2026)

Self-referential instances of the dominating set problem are irreducible
par: Zhou, Guangyan
Publié: (2026)

A Subquadratic Two-Party Communication Protocol for Minimum Cost Flow
par: Gholizadeh, Hossein, et autres
Publié: (2025)

Frontier Space-Time Algorithms Using Only Full Memory
par: Chmel, Petr, et autres
Publié: (2026)

Improved Bounds for Twin-Width Parameter Variants with Algorithmic Applications to Counting Graph Colorings
par: Baril, Ambroise, et autres
Publié: (2025)

A Simpler Exponential-Time Approximation Algorithm for MAX-k-SAT
par: Buhrman, Harry, et autres
Publié: (2025)

Faster Exponential-Time Approximation Algorithms Using Approximate Monotone Local Search
par: Esmer, Barış Can, et autres
Publié: (2022)

Efficient Catalytic Graph Algorithms
par: Cook, James, et autres
Publié: (2025)

Sensitivity Lower Bounds for Approximaiton Algorithms
par: Fleming, Noah, et autres
Publié: (2024)

Algorithms and Hardness for Estimating Statistical Similarity
par: Bhattacharyya, Arnab, et autres
Publié: (2025)

Parameterized Algorithms for Editing to Uniform Cluster Graph
par: Gaikwad, Ajinkya, et autres
Publié: (2024)

Semi-Streaming Algorithms for Graph Property Certification
par: Das, Avinandan, et autres
Publié: (2025)

Exact Algorithms for Distance to Unique Vertex Cover
par: Fioravantes, Foivos, et autres
Publié: (2025)

Hardness and Algorithmic Results for Roman \{3\}-Domination
par: Reddy, Sangam Balchandar
Publié: (2025)

Capacitated Fair-Range Clustering: Hardness and Approximation Algorithms
par: Gadekar, Ameet, et autres
Publié: (2025)

From Amortized to Worst Case Delay in Enumeration Algorithms
par: Capelli, Florent, et autres
Publié: (2021)

Improved Hardness-of-Approximation for Token Swapping
par: Hiken, Sam, et autres
Publié: (2024)

Improved Space Bounds for Subset Sum
par: Belova, Tatiana, et autres
Publié: (2024)

Algorithms for the Diverse-k-SAT problem: the geometry of satisfying assignments
par: Austrin, Per, et autres
Publié: (2024)

A Faster Randomized Algorithm for Vertex Cover: An Automated Approach
par: Clinch, Katie, et autres
Publié: (2025)

Towards Deterministic Algorithms for Constant-Depth Factors of Constant-Depth Circuits
par: Kumar, Mrinal, et autres
Publié: (2024)

Reconstructing Sets of Strings from Their k-way Projections: Algorithms & Complexity
par: Tate, Elise, et autres
Publié: (2025)

TwinArray Sort: An Ultrarapid Conditional Non-Comparison Based Sorting Algorithm
par: Amini, Amin
Publié: (2024)

Inclusive and Exclusive Vertex Splitting into Specific Graph Classes: NP Hardness and Algorithms
par: Gaikwad, Ajinkya, et autres
Publié: (2025)

An $\widetilde{O} (n^{3/7})$ Round Parallel Algorithm for Matroid Bases
par: Khanna, Sanjeev, et autres
Publié: (2026)

Near Optimal Algorithms for Noisy $k$-XOR under Low-Degree Heuristic
par: Mao, Songtao
Publié: (2026)

End Cover for Initial Value Problem: Complete Validated Algorithms with Complexity Analysis
par: Zhang, Bingwei, et autres
Publié: (2026)

Turnstile Streaming Algorithms Might (Still) as Well Be Linear Sketches, for Polynomial-Length Streams
par: Jiang, Cheng, et autres
Publié: (2026)

Tight Complexity Bounds for Counting Generalized Dominating Sets in Bounded-Treewidth Graphs Part I: Algorithmic Results
par: Focke, Jacob, et autres
Publié: (2022)