Copertina

Strongly Polynomial Frame Scaling to High Precision

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autori principali:	Dadush, Daniel, Ramachandran, Akshay
Natura:	Preprint
Pubblicazione:	2024
Soggetti:	Data Structures and Algorithms Optimization and Control
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

A nearly optimal randomized algorithm for explorable heap selection
di: Borst, Sander, et al.
Pubblicazione: (2022)

Interior point methods are not worse than Simplex
di: Allamigeon, Xavier, et al.
Pubblicazione: (2022)

Circuit Diameter of Polyhedra is Strongly Polynomial
di: Natura, Bento
Pubblicazione: (2026)

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

On Matrices over a Polynomial Ring with Restricted Subdeterminants
di: Celaya, Marcel, et al.
Pubblicazione: (2023)

Dynamic Batching of Online Arrivals to Leverage Economies of Scale
di: Bhimaraju, Akhil, et al.
Pubblicazione: (2023)

From Incremental Transitive Cover to Strongly Polynomial Maximum Flow
di: Dadush, Daniel, et al.
Pubblicazione: (2025)

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

Improved Speed via Regional Fulfillment
di: Hathcock, Daniel, et al.
Pubblicazione: (2026)

An Efficient Algorithm for Minimizing Ordered Norms in Fractional Load Balancing
di: Blankenburg, Daniel, et al.
Pubblicazione: (2025)

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

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

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

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

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

The Robust Bilevel Selection Problem
di: Henke, Dorothee
Pubblicazione: (2024)

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

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

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

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

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

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

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

Fully Subexponential Time Approximation Scheme for Product Partition
di: Costandin, Marius
Pubblicazione: (2024)

Optimization in Sanger Sequencing
di: Carpente, Luisa, et al.
Pubblicazione: (2024)

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

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

On computing approximate Lewis weights
di: Apers, Simon, et al.
Pubblicazione: (2024)

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

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

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

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

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

A Decomposition Theorem for Dynamic Flows
di: Graf, Lukas, et al.
Pubblicazione: (2024)

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

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

Radial Isotropic Position via an Implicit Newton's Method
di: Jambulapati, Arun, et al.
Pubblicazione: (2025)

Balancing Gradient and Hessian Queries in Non-Convex Optimization
di: Adil, Deeksha, et al.
Pubblicazione: (2025)

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

Deriving the Gradients of Some Popular Optimal Transport Algorithms
di: Xie, Fangzhou
Pubblicazione: (2025)