Sciweavers

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

82

ISAAC
2007
Springer

95views Algorithms» more ISAAC 2007»

Hardness and Approximation of Traffic Grooming

15 years 9 months ago

Hardness and Approximation of Traffic Grooming

Download www.cs.technion.ac.il

Omid Amini, Stéphane Pérennes, Ignas

Real-time Traffic

ISAAC 2007 |

claim paper

Related Content

» Approximation Algorithms for Traffic Grooming in WDM Rings

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

» Approximating the traffic grooming problem

» Alternate Routing in Tandem TrafficGroomed Optical Networks

» Performance Analysis of TrafficGroomed Optical Networks Employing Alternate Routing Techni...

» Traffic Grooming in Star Networks via Matching Techniques

» Routing multiclass traffic flows in the plane

» A Predictability Analysis of Network Traffic

» Bounding PeertoPeer Upload Traffic in Client Networks

Post Info
More Details (n/a)

Added	08 Jun 2010
Updated	08 Jun 2010
Type	Conference
Year	2007
Where	ISAAC
Authors	Omid Amini, Stéphane Pérennes, Ignasi Sau

Comments (0)