Optimal Oblivious Routing in Polynomial Time - PowerPoint PPT Presentation

1 / 16
} ?>
View by Category
About This Presentation
Title:

Optimal Oblivious Routing in Polynomial Time

Description:

Routing f: Route each OD pair on direct edge. Demands D: unit demand for all pairs ... Subset of OD pair demands. Ranges of demands. Node congestion. Limiting ... – PowerPoint PPT presentation

Number of Views:46
Avg rating:3.0/5.0
Slides: 17
Provided by: eco6
Category:

less

Write a Comment
User Comments (0)
About PowerShow.com