Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

11

FOCS
1998
IEEE

favoriteEmaildiscussreport

118views Theoretical Computer Science» more FOCS 1998»

The Complexity of the Approximation of the Bandwidth Problem

13 years 8 months ago

The Complexity of the Approximation of the Bandwidth Problem

Download www.cs.ust.hk

d Abstract) Walter Unger Lehrstuhl f

Walter Unger

Real-time Traffic

D-52074 Aachen Germany | FOCS 1998 | RWTH Aachen Ahornstraße | Theoretical Computer Science |

claim paper

Related Content

» Approximate Bandwidth Allocation for Compositional RealTime Systems

» Approximation Algorithms for Bandwidth and Storage Allocation Problems under Real Time Con...

» Interactive rendering of acquired materials on dynamic geometry using bandwidth prediction

» Approximating Circular Arc Colouring and Bandwidth Allocation in AllOptical Ring Networks

» Modelling layer 2 and layer 3 device bandwidths using Bnode theory

» Varying bandwidth resource allocation problem with bag constraints

» Some Applications of Graph Bandwidth to Constraint Satisfaction Problems

» Polynomial Time Approximations for MultiPath Routing with Bandwidth and Delay Constraints

» An Exponential Time 2Approximation Algorithm for Bandwidth

Post Info
More Details (n/a)

Added	04 Aug 2010
Updated	04 Aug 2010
Type	Conference
Year	1998
Where	FOCS
Authors	Walter Unger

Comments (0)