Cover Image

3.415-Approximation for Coflow Scheduling via Iterated Rounding

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Rohwedder, Lars, Schnaars, Leander
Format:	Preprint
Published:	2025
Subjects:	Data Structures and Algorithms Optimization and Control
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

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

Multiplicative assignment with upgrades
by: Armbruster, Alexander, et al.
Published: (2025)

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

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

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

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

Improved $\ell_{p}$ Regression via Iteratively Reweighted Least Squares
by: Ene, Alina, et al.
Published: (2025)

Robust Gittins for Stochastic Scheduling
by: Moseley, Benjamin, et al.
Published: (2025)

ALNS for Tugboat Scheduling in Inland Waterway
by: Ma, Zihang
Published: (2025)

Randomized Rounding over Dynamic Programs
by: Bamas, Etienne, et al.
Published: (2025)

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

Cost Preserving Dependent Rounding for Allocation Problems
by: Rohwedder, Lars, et al.
Published: (2025)

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

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

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

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

Acceleration by Stepsize Hedging I: Multi-Step Descent and the Silver Stepsize Schedule
by: Altschuler, Jason M., et al.
Published: (2023)

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

Fully Subexponential Time Approximation Scheme for Product Partition
by: Costandin, Marius
Published: (2024)

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

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

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

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

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

ETH-Tight FPT Algorithm for Makespan Minimization on Uniform Machines
by: Rohwedder, Lars
Published: (2025)

Smoothed Analysis of the k-Swap Neighborhood for Makespan Scheduling
by: Rohwedder, Lars, et al.
Published: (2024)

A k-swap Local Search for Makespan Scheduling
by: Rohwedder, Lars, et al.
Published: (2024)

Improved Speed via Regional Fulfillment
by: Hathcock, Daniel, et al.
Published: (2026)

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

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

Near-Optimal Sample Complexity for MDPs via Anchoring
by: Lee, Jongmin, et al.
Published: (2025)

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

Flow Shop Scheduling with Stochastic Reentry
by: von Aspern, Maximilian, et al.
Published: (2026)

Truncated Variance Reduced Value Iteration
by: Jin, Yujia, et al.
Published: (2024)

Optimal Micro-Transit Zoning via Clique Generation and Integer Programming
by: Hu, Hins, et al.
Published: (2025)

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

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

TSP integrality gap via 2-edge-connected multisubgraph problem under coincident IP optima
by: Yamanaka, Toshiaki
Published: (2025)

Indirect Coflow Scheduling
by: Lindermayr, Alexander, et al.
Published: (2025)

Learning to Schedule in Parallel-Server Queues with Stochastic Bilinear Rewards
by: Kim, Jung-hun, et al.
Published: (2021)