Sciweavers
Explore
Publications
Books
Software
Tutorials
Presentations
Lectures Notes
Datasets
Labs
Conferences
Community
Upcoming
Conferences
Top Ranked Papers
Most Viewed Conferences
Conferences by Acronym
Conferences by Subject
Conferences by Year
Tools
PDF Tools
Image Tools
Text Tools
OCR Tools
Symbol and Emoji Tools
On-screen Keyboard
Latex Math Equation to Image
Smart IPA Phonetic Keyboard
Community
Sciweavers
About
Terms of Use
Privacy Policy
Cookies
Free Online Productivity Tools
i2Speak
i2Symbol
i2OCR
iTex2Img
iWeb2Print
iWeb2Shot
i2Type
iPdf2Split
iPdf2Merge
i2Bopomofo
i2Arabic
i2Style
i2Image
i2PDF
iLatex2Rtf
Sci2ools
82
click to vote
ISAAC
2007
Springer
95
views
Algorithms
»
more
ISAAC 2007
»
Hardness and Approximation of Traffic Grooming
15 years 9 months ago
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
more »
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)
Researcher Info
Algorithms Study Group
Computer Vision