1429 search results - page 1 / 286 » The Complexity of the Approximation of the Bandwidth Problem |
FOCS
1998
IEEE
13 years 9 months ago
1998
IEEE
d Abstract) Walter Unger Lehrstuhl f
ECRTS
2009
IEEE
13 years 2 months ago
2009
IEEE
Allocation of bandwidth among components is a fundamental problem in compositional real-time systems. Stateof-the-art algorithms for bandwidth allocation use either exponential-ti...
FSTTCS
2000
Springer
13 years 8 months ago
2000
Springer
SI3D
2012
ACM
12 years 12 days ago
2012
ACM
Shading complex materials such as acquired reflectances in multilight environments is computationally expensive. Estimating the shading integral requires multiple samples of the ...
APPROX
1998
Springer
13 years 9 months ago
1998
Springer
We present randomized approximation algorithms for the circular arc graph colouring problem and for the problem of bandwidth allocation in all-optical ring networks. We obtain a fa...