Imagen de Portada

An $O(n\log n)$ Algorithm for Single-Item Lot Sizing with a One-Breakpoint All-Units Discount and Non-Increasing Prices

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autor principal:	Papadopoulos, Kleitos
Formato:	Preprint
Publicado:	2025
Materias:	Data Structures and Algorithms
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

An $O(n^5)$-Time Algorithm for Optimal Broadcast Domination
por: Papadopoulos, Kleitos
Publicado: (2026)

An $\mathcal{O}(\log N)$ Time Algorithm for the Generalized Egg Dropping Problem
por: Papadopoulos, Kleitos
Publicado: (2026)

A Novel exact algorithm for economic lot-sizing with piecewise linear production costs
por: Papadopoulos, Kleitos
Publicado: (2024)

A faster algorithm for the construction of optimal factoring automata
por: Erlebach, Thomas, et al.
Publicado: (2024)

$O(\log n)$-Approximation Algorithms for Bipartiteness Ratio
por: Soma, Tasuku, et al.
Publicado: (2025)

Fully Dynamic Connectivity in $O(\log n(\log\log n)^2)$ Amortized Expected Time
por: Huang, Shang-En, et al.
Publicado: (2016)

Finding a solution to the Erdős-Ginzburg-Ziv theorem in $O(n\log\log\log n)$ time
por: Leung, Yui Hin Arvin
Publicado: (2025)

PCF Learned Sort: a Learning Augmented Sort Algorithm with $O(n \log\log n)$ Expected Complexity
por: Sato, Atsuki, et al.
Publicado: (2024)

On the Hardness Hierarchy for the $O(n \sqrt{\log n})$ Complexity in the Word RAM
por: Kempa, Dominik, et al.
Publicado: (2025)

Embedding Planar Graphs into Graphs of Treewidth $O(\log^{3} n)$
por: Chang, Hsien-Chih, et al.
Publicado: (2024)

Path-Reporting Distance Oracles with Logarithmic Stretch and Size O(n loglog n)
por: Elkin, Michael, et al.
Publicado: (2023)

Building a Balanced k-d Tree in O(kn log n) Time
por: Brown, Russell A.
Publicado: (2014)

Fully dynamic biconnectivity in $\tilde{\mathcal{O}}(\log^2 n)$ time
por: Holm, Jacob, et al.
Publicado: (2025)

Non-Adaptive Evaluation of $k$-of-$n$ Functions: Tight Gap and a Unit-Cost PTAS
por: Nielsen, Mads Anker, et al.
Publicado: (2025)

LZBE: an LZ-style compressor supporting $O(\log n)$-time random access
por: Shibata, Hiroki, et al.
Publicado: (2025)

A simpler and parallelizable $O(\sqrt{\log n})$-approximation algorithm for Sparsest Cut
por: Kolmogorov, Vladimir
Publicado: (2023)

An $O(n \log n)$-Time Approximation Scheme for Geometric Many-to-Many Matching
por: Bandyapadhyay, Sayan, et al.
Publicado: (2024)

A Refutation of Elmasry's $\tilde{O}(m \sqrt{n})$-Time Algorithm for Single-Source Shortest Paths
por: Atalig, Sunny, et al.
Publicado: (2025)

A Simpler Approach for Monotone Parametric Minimum Cut: Finding the Breakpoints in Order
por: Beines, Arne, et al.
Publicado: (2024)

The Contiguous Art Gallery Problem is in Θ(n log n)
por: de Berg, Sarita, et al.
Publicado: (2025)

Online Bin Packing with Item Size Estimates
por: Gehnen, Matthias, et al.
Publicado: (2025)

An $n^{2+o(1)}$ Time Algorithm for Single-Source Negative Weight Shortest Paths
por: Khanna, Sanjeev, et al.
Publicado: (2026)

The planar edge-coloring theorem of Vizing in $O(n\log n)$ time
por: Jędrzejczak, Patryk, et al.
Publicado: (2025)

Learning Multinomial Logits in $O(n \log n)$ time
por: Chierichetti, Flavio, et al.
Publicado: (2026)

Adaptive BSTs for Single-Source and All-to-All Requests: Algorithms and Lower Bounds
por: Shiran, Maryam
Publicado: (2025)

New Algorithm for Combinatorial $n$-folds and Applications
por: Jansen, Klaus, et al.
Publicado: (2024)

Gabow's $O(\sqrt{n}m)$ Maximum Cardinality Matching Algorithm, Revisited
por: Mehlhorn, Kurt, et al.
Publicado: (2026)

All-Pairs Minimum Cut using $\tilde{O}(n^{7/4})$ Cut Queries
por: Kenneth-Mordoch, Yotam, et al.
Publicado: (2025)

Sample Complexity of Posted Pricing for a Single Item
por: Jin, Billy, et al.
Publicado: (2024)

An $Ω(n \log n)$ Randomized Lower Bound for Cutting a Cake into Proportionally Fair Pieces
por: Arndt, Stephen, et al.
Publicado: (2026)

Stochastic Matching via In-n-Out Local Computation Algorithms
por: Azarmehr, Amir, et al.
Publicado: (2024)

Southwest Tree: A Low-Memory Data Structure for Partial Accumulations by Non-Commutative Invertible Operations
por: Papadopoulos, Nicholas J. C.
Publicado: (2025)

Algorithms and Complexity of Hedge Cluster Deletion Problems
por: Konstantinidis, Athanasios L., et al.
Publicado: (2025)

An $Ω( (\log n / \log \log n)^2 )$ Cell-Probe Lower Bound for Dynamic Boolean Data Structures
por: Ko, Young Kun
Publicado: (2026)

Maximum Bipartite Matching in $n^{2+o(1)}$ Time via a Combinatorial Algorithm
por: Chuzhoy, Julia, et al.
Publicado: (2024)

An Objective Improvement Approach to Solving Discounted Payoff Games
por: Dell'Erba, Daniele, et al.
Publicado: (2024)

Dynamic Pricing Algorithms for Online Set Cover
por: Bender, Max, et al.
Publicado: (2024)

$(Δ+ 1)$ Vertex Coloring in $O(n)$ Communication
por: Flin, Maxime, et al.
Publicado: (2024)

Dynamic $((1+ε)\ln n)$-Approximation Algorithms for Minimum Set Cover and Dominating Set
por: Solomon, Shay, et al.
Publicado: (2023)

On the FirstFit Algorithm for Online Unit-Interval Coloring
por: Krekelberg, Bob, et al.
Publicado: (2025)