Approximation algorithms for the ring loading problem with penalty cost

DOI10.1016/j.ipl.2013.08.004zbMath1329.68291OpenAlexW1980822965MaRDI QIDQ2350601

Weidong Li, Li Guan, Jianping Li

Publication date: 25 June 2015

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2013.08.004

zbMATH Keywords

approximation algorithmspenalty costring loading

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25)

Related Items (2)

Online mixed ring covering problem with two nodes ⋮ Approximation algorithms for the multiprocessor scheduling with submodular penalties

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Call control in rings
• Call control with \(k\) rejections
• An Efficient Algorithm for the Ring Loading Problem with Integer Demand Splitting
• Admission control to minimize rejections and online set cover with repetitions
• A quasi-PTAS for unsplittable flow on line graphs
• Optimal online ring routing
• An improved approximation algorithm for resource allocation
• Linear time algorithms for the ring loading problem with demand splitting
• Admission Control to Minimize Rejections
• The Ring Loading Problem
• A Constant Factor Approximation Algorithm for Unsplittable Flow on Paths

This page was built for publication: Approximation algorithms for the ring loading problem with penalty cost