Imagen de Portada

Approximation Schemes for Sequential Hiring Problems

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Segev, Danny, Stein, Uri
Formato:	Preprint
Publicado:	2026
Materias:	Data Structures and Algorithms Optimization and Control
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Economic Warehouse Lot Scheduling: Approximation Schemes via Efficiently-Representable DP-Encoded Policies
por: Segev, Danny
Publicado: (2026)

New Approximation Guarantees for The Economic Warehouse Lot Scheduling Problem
por: Segev, Danny
Publicado: (2024)

Improved Approximation Guarantees for Joint Replenishment in Continuous Time
por: Segev, Danny
Publicado: (2024)

Economic Warehouse Lot Scheduling: Breaking the 2-Approximation Barrier
por: Segev, Danny
Publicado: (2026)

Improved Approximation Guarantees and Hardness Results for MNL-Driven Product Ranking
por: Segev, Danny, et al.
Publicado: (2025)

Resource-Constrained Joint Replenishment via Power-of-$m^{1/k}$ Policies
por: Segev, Danny
Publicado: (2026)

Near-Optimal Dynamic Policies for Joint Replenishment in Continuous/Discrete Time
por: Segev, Danny
Publicado: (2025)

Branch-and-Bound Algorithms as Polynomial-time Approximation Schemes
por: Encz, Koppány István, et al.
Publicado: (2025)

Fully Subexponential Time Approximation Scheme for Product Partition
por: Costandin, Marius
Publicado: (2024)

On Approximation of Robust Max-Cut and Related Problems using Randomized Rounding Algorithms
por: Shi, Haoyan, et al.
Publicado: (2024)

Revenue Maximization in Choice-Based Matching Markets
por: Nissim, Dan, et al.
Publicado: (2024)

Sum-Of-Squares To Approximate Knapsack
por: Kothari, Pravesh K., et al.
Publicado: (2025)

New Approximation Guarantees for The Inventory Staggering Problem
por: Alon, Noga, et al.
Publicado: (2025)

3.415-Approximation for Coflow Scheduling via Iterated Rounding
por: Rohwedder, Lars, et al.
Publicado: (2025)

Accelerated Approximate Optimization of Multi-Commodity Flows on Directed Graphs
por: Chen, Li, et al.
Publicado: (2025)

Two-sided Assortment Optimization: Adaptivity Gaps and Approximation Algorithms
por: Housni, Omar El, et al.
Publicado: (2024)

The Robust Bilevel Selection Problem
por: Henke, Dorothee
Publicado: (2024)

The Fair Periodic Assignment Problem
por: van Lieshout, Rolf, et al.
Publicado: (2025)

On the Complexity of Bilevel Independent Set Problem
por: Muluk, Komal
Publicado: (2026)

Efficient Approximation Schemes for Stochastic Probing and Selection-Stopping Problems
por: Segev, Danny, et al.
Publicado: (2020)

Approximating $q \rightarrow p$ Norms of Non-Negative Matrices in Nearly-Linear Time
por: Objois, Étienne, et al.
Publicado: (2025)

Parameterized Complexity of Scheduling Problems in Robotic Process Automation
por: Dvořák, Michal, et al.
Publicado: (2026)

Generalized Assignment and Knapsack Problems in the Random-Order Model
por: Klimm, Max, et al.
Publicado: (2025)

An Optimal Algorithm for the Stacker Crane Problem on Fixed Topologies
por: Chen, Yike, et al.
Publicado: (2024)

Solving the Probabilistic Profitable Tour Problem on a Tree
por: Angelelli, Enrico, et al.
Publicado: (2022)

A Faster Parametric Search for the Integral Quickest Transshipment Problem
por: Anapolska, Mariia, et al.
Publicado: (2025)

Bounds for the Permutation Flowshop Scheduling Problem: New Framework and Theoretical Insights
por: Alejandro-Soto, J. A., et al.
Publicado: (2025)

The Restricted Inverse Optimal Value Problem under Weighted Bottle-neck Hamming distance on trees
por: Zhang, Qiao, et al.
Publicado: (2024)

Cascading-Tree Algorithm for the 0-1 Knapsack Problem (In Memory of Heiner M{ü}ller-Merbach, a Former President of IFORS)
por: Moeini, Mahdi, et al.
Publicado: (2024)

Safe Sequences via Dominators in DAGs for Path-Covering Problems
por: Sena, Francisco, et al.
Publicado: (2024)

Approximation Algorithms for Fair Repetitive Scheduling
por: Hermelin, Danny, et al.
Publicado: (2025)

A Threshold Phenomenon for the Shortest Lattice Vector Problem in the Infinity Norm
por: Kuhlmann, Stefan, et al.
Publicado: (2025)

Automated Discovery of Branching Rules with Optimal Complexity for the Maximum Independent Set Problem
por: Gao, Xuan-Zhao, et al.
Publicado: (2024)

ResQue Greedy: Rewiring Sequential Greedy for Improved Submodular Maximization
por: Gallart, Joan Vendrell, et al.
Publicado: (2025)

A 1/2-Approximation for Budgeted $k$-Submodular Maximization
por: Wang, Chenhao
Publicado: (2025)

Quantum Approximate Optimization Algorithms for Maximum Cut on Low-Girth Graphs
por: Li, Tongyang, et al.
Publicado: (2024)

Coordinating Spot and Contract Supply in Freight Marketplaces
por: Kaminsky, Philip, et al.
Publicado: (2026)

Scalable First-Order Interior Point Trust Region Algorithms for Linearly Constrained Optimization
por: Su, Yuexin, et al.
Publicado: (2026)

Handicap reduction for linear complementarity problems
por: -Nagy, Marianna E., et al.
Publicado: (2026)

Optimizing for Fairness in Generalized Kidney Exchange: Theory and Computations
por: Chang, Claire, et al.
Publicado: (2026)