scientific article; zbMATH DE number 7278054

DOI10.4230/LIPICS.ISAAC.2017.49MaRDI QIDQ5136269zbMATH OpenFDO

Authors Hamidreza Jahanjou, E. Kantor, Rajmohan Rajaraman

Publication date 25 November 2020

Full work available at URL https://arxiv.org/abs/1708.00143

zbMATH Keywords

approximation algorithmsflow schedulinginterval coloringonline algorithmsunsplittable flows

Mathematics Subject Classification ID

Approximation algorithms (68W25) Online algorithms; streaming algorithms (68W27) Deterministic network models in operations research (90B10) Deterministic scheduling theory in operations research (90B35)

Recommendations

• Improved algorithms for scheduling unsplittable flows on paths
• Improved approximation algorithms for unsplittable flow on a path with time windows
• New Algorithms for the Unsplittable Flow Problem
• Approximation algorithms for the unsplittable flow problem
• scientific article; zbMATH DE number 1947047
• Approximation algorithms for the unsplittable flow problem on paths and trees
• Improved bounds for the unsplittable flow problem
• New approximation schemes for unsplittable flow on a path
• A constant-factor approximation algorithm for unsplittable flow on paths
• scientific article; zbMATH DE number 1775441

Cites work

• A constant factor approximation algorithm for unsplittable flow on paths
• A logarithmic approximation for unsplittable flow on line graphs
• A quasi-PTAS for unsplittable flow on line graphs
• A unified approach to approximating resource allocation and scheduling
• An improved algorithm for online coloring of intervals with bandwidth
• An improved approximation algorithm for \textsc{Resource Allocation}
• Approximation algorithms for the unsplittable flow problem on paths and trees
• Approximation and Online Algorithms
• Automata, Languages and Programming
• Coloring and maximum independent set of rectangles
• Constant integrality gap LP formulations of unsplittable flow on a path
• scientific article; zbMATH DE number 3769624 (Why is no real title available?)
• scientific article; zbMATH DE number 2038727 (Why is no real title available?)
• scientific article; zbMATH DE number 2145236 (Why is no real title available?)
• scientific article; zbMATH DE number 1445390 (Why is no real title available?)
• On a Coloring Problem.
• Online capacitated interval coloring
• Primal-dual approximation algorithms for integral flow and multicut in trees
• Resource allocation with time intervals
• Scheduling jobs with fixed start and end times
• The Linearity of First-Fit Coloring of Interval Graphs
• The Temporal Knapsack Problem and Its Solution

Cited in

(3)

• Improved algorithms for scheduling unsplittable flows on paths
• How Unsplittable-Flow-Covering Helps Scheduling with Job-Dependent Cost Functions
• Approximation algorithms for round-UFP and round-SAP

This page was built for publication:

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