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
Sci2ools
International Keyboard
Graphical Social Symbols
CSS3 Style Generator
OCR
Web Page to Image
Web Page to PDF
Merge PDF
Split PDF
Latex Equation Editor
Extract Images from PDF
Convert JPEG to PS
Convert Latex to Word
Convert Word to PDF
Image Converter
PDF Converter
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
28
click to vote
JDA
2008
favorite
Email
discuss
report
96
views
more
JDA 2008
»
Approximating the traffic grooming problem
13 years 10 months ago
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
more »
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)
Researcher Info
JDA 2006 Study Group
Computer Vision