Publication:4252403
From MaRDI portal
zbMath0934.68039MaRDI QIDQ4252403
Publication date: 17 June 1999
68N20: Theory of compilers and interpreters
Related Items
An Improved Upper Bound for the Ring Loading Problem, Dynamic storage allocation with known durations, A constant factor approximation algorithm for the storage allocation problem, Single and multiple device DSA problems, complexities and online algorithms, Using fractional primal-dual to schedule split intervals with demands, About equivalent interval colorings of weighted graphs, Resource allocation in bounded degree trees, Dynamic spectrum allocation: the impotency of duration notification., An approximation result for the interval coloring problem on claw-free chordal graphs, On spectrum assignment in elastic optical tree-networks, Approximation algorithms for routing and call scheduling in all-optical chains and rings., On the interval chromatic number of proper interval graphs, Optimizing bandwidth allocation in elastic optical networks with application to scheduling, A $$(2+\epsilon )$$-Approximation Algorithm for the Storage Allocation Problem