Sciweavers

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

9

JDA
2008

favoriteEmaildiscussreport

96views more JDA 2008»

Approximating the traffic grooming problem

13 years 4 months ago

Approximating the traffic grooming problem

Download www.cs.sfu.ca

Michele Flammini, Luca Moscardelli, Mordechai Shal

Real-time Traffic

JDA 2008 |

claim paper

Related Content

» Approximation Algorithms for Traffic Grooming in WDM Rings

» On Traffic Grooming Choices for IP over WDM networks

» Traffic Grooming in Star Networks via Matching Techniques

» Grooming for twoperiod optical networks

» Traffic Grooming in WDM Ring Networks with the MinMax Objective

» Traffic grooming in path star and tree networks complexity bounds and algorithms

» Spare Capacity Provisioning for Dynamic Traffic Grooming in Optical Networks

» Approximation Techniques for the Analysis of Large TrafficGroomed Tandem Optical Networks

» Hardness and Approximation of Traffic Grooming

Post Info
More Details (n/a)

Added	13 Dec 2010
Updated	13 Dec 2010
Type	Journal
Year	2008
Where	JDA
Authors	Michele Flammini, Luca Moscardelli, Mordechai Shalom, Shmuel Zaks

Comments (0)