Algorithms for compile-time memory optimization
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Routing and path multicoloring
Information Processing Letters
Wavelength assignment and generalized interval graph coloring
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
OPT versus LOAD in dynamic storage allocation
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Methods and Problems of Wavelength-Routing in All-Optical Networks
Methods and Problems of Wavelength-Routing in All-Optical Networks
Multicommodity demand flow in a tree
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
Island hopping and path colouring with applications to WDM network design
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
| Hi-index | 0.00 |
Winkler and Zhang introduced the FIBER MINIMIZATION problem in [10]. They showed that the problem is NP-complete but left the question of approximation algorithms open. We give a simple 2-approximation algorithm for this problem. We also show how ideas from the Dynamic Storage Allocation algorithm of Buchsbaum et al. [4] can be used to give an approximation ratio arbitrarily close to 1 provided the problem instance satisfies certain criteria. We also show that these criteria are necessary to obtain an approximation scheme. Our 2-approximation algorithm achieves its guarantee unconditionally. We also consider the extension of the problem to a ring network and give a 2+o(1)-approximation algorithm for this topology. Our techniques also yield a factor-2 approximation for the related problem of PACKING INTERVALS IN INTERVALS, also introduced by Winkler and Zhang in [10].