3.415-approximation for coflow scheduling via iterated rounding

DOI10.4230/LIPICS.ICALP.2025.128MaRDI QIDQ7397586zbMATH OpenFDO

Authors Lars Rohwedder, Leander Schnaars

Publication date 2025

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.4230/LIPICS.ICALP.2025.128

Mathematics Subject Classification ID

Theory of software (68Nxx) Theory of computing (68Qxx)

Cites work

• ``Integer-making theorems
• A Strongly Polynomial Algorithm to Solve Combinatorial Linear Programs
• scientific article; zbMATH DE number 4089320 (Why is no real title available?)
• Integrality gap of time-indexed linear programming relaxation for coflow scheduling
• Matroid coflow scheduling
• Minimizing the sum of weighted completion times in a concurrent open shop
• New developments in iterated rounding (invited talk)
• On scheduling coflows (extended abstract)
• Order Scheduling Models: Hardness and Algorithms
• Scheduling orders for multiple product types to minimize total weighted completion time
• Select and permute: an improved online framework for scheduling to minimize weighted completion time
• Über Graphen und ihre Anwendung auf Determinantentheorie und Mengenlehre.

This page was built for publication: 3.415-approximation for coflow scheduling via iterated rounding

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7397586)