Costly Circuits, Submodular Schedules and Approximate Carathéodory Theorems

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%

Keyphrases

• Hybrid Switching 50%
• Carathéodory's Theorem 50%
• Birkhoff Polytope 50%
• Indirect Routing 50%
• Submodular Optimization 50%