Imagen de Portada

Fully Subexponential Time Approximation Scheme for Product Partition

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autor principal:	Costandin, Marius
Formato:	Preprint
Publicado:	2024
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

Approximation Schemes for Sequential Hiring Problems
por: Segev, Danny, et al.
Publicado: (2026)

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

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

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

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

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

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

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

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

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

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

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

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

When Location Shapes Choice: Placement Optimization of Substitutable Products
por: Housni, Omar El, et al.
Publicado: (2023)

Online Decision Making with Fairness over Time
por: Chen, Rui, et al.
Publicado: (2022)

Near-Optimal Dynamic Policies for Joint Replenishment in Continuous/Discrete Time
por: Segev, Danny
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)

Computational complexity of the recoverable robust shortest path problem in acyclic digraphs
por: Kasperski, Adam, et al.
Publicado: (2024)

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

On contention resolution for the hypergraph matching, knapsack, and $k$-column sparse packing problems
por: Sergeev, Ivan
Publicado: (2024)

Distributionally Robust Newsvendor on a Metric
por: Foussoul, Ayoub, et al.
Publicado: (2024)

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

A rounding and clustering-based exact algorithm for the p-center problem
por: Ales, Zacharie, et al.
Publicado: (2024)

Extracting Dual Solutions via Primal Optimizers
por: Carmon, Yair, et al.
Publicado: (2024)

On the complexity of the upgrading version of the maximal covering location problem
por: Baldomero-Naranjo, Marta, et al.
Publicado: (2024)

Accelerating Proximal Gradient Descent via Silver Stepsizes
por: Bok, Jinho, et al.
Publicado: (2024)

Acceleration Meets Inverse Maintenance: Faster $\ell_{\infty}$-Regression
por: Adil, Deeksha, et al.
Publicado: (2024)

Convex optimization with $p$-norm oracles
por: Adil, Deeksha, et al.
Publicado: (2024)

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

Optimization in Sanger Sequencing
por: Carpente, Luisa, et al.
Publicado: (2024)

Strongly Polynomial Frame Scaling to High Precision
por: Dadush, Daniel, et al.
Publicado: (2024)

Acceleration by Random Stepsizes: Hedging, Equalization, and the Arcsine Stepsize Schedule
por: Altschuler, Jason M., et al.
Publicado: (2024)

A Unified Algorithmic Framework for Dynamic Assortment Optimization under MNL Choice
por: Sun, Shuo, et al.
Publicado: (2024)

On computing approximate Lewis weights
por: Apers, Simon, et al.
Publicado: (2024)

Online Matching on $3$-Uniform Hypergraphs
por: Borst, Sander, et al.
Publicado: (2024)

Differentiable Extensions with Rounding Guarantees for Combinatorial Optimization over Permutations
por: Nerem, Robert R., et al.
Publicado: (2024)

A Decomposition Theorem for Dynamic Flows
por: Graf, Lukas, 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)

(Near)-Optimal Algorithms for Sparse Separable Convex Integer Programs
por: Hunkenschröder, Christoph, et al.
Publicado: (2025)