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