Costly circuits, submodular schedules and approximate Carathéodory Theorems

Keyphrases

• Traffic Demand 100%
• Circuit Switching 100%
• Load Balancing 50%
• Optimal Scheduling 50%
• Strong Connections 50%
• High Bandwidth 50%
• Nearly Optimal 50%
• Approximate Solution 50%
• Reconfiguration 50%
• Wireless 50%
• Multipath Routing 50%
• Link Rate 50%
• Balance Effect 50%
• Fast Solution 50%
• Low Bandwidth 50%
• Large Data Center 50%
• Reconfiguration Delay 50%
• Reconfiguration Cost 50%
• Optimal Schedule 50%
• Birkhoff Polytope 50%
• Indirect Routing 50%
• Submodular Optimization 50%

Computer Science

• Reconfiguration 100%
• Traffic Demand 66%
• Load Balancing 33%
• Scheduling Algorithm 33%
• Approximate Solution 33%
• Large Scale Data 33%
• Data Center 33%
• Multi-hop Routing 33%