Pages that link to "Item:Q5943097"
From MaRDI portal
The following pages link to Competitive routing of virtual circuits with unknown duration (Q5943097):
Displaying 9 items.
- Competitive and deterministic embeddings of virtual networks (Q391268) (← links)
- Competitive routing over time (Q719282) (← links)
- Scheduling of online compute-intensive synchronized jobs on high performance virtual clusters (Q730496) (← links)
- Online load balancing with general reassignment cost (Q2157902) (← links)
- A nonmonotone analysis with the primal-dual approach: online routing of virtual circuits with unknown durations (Q2345465) (← links)
- A Nonmonotone Analysis with the Primal-Dual Approach: Online Routing of Virtual Circuits with Unknown Durations (Q2868635) (← links)
- Robust Polynomial-Time Approximation Schemes for Parallel Machine Scheduling with Job Arrivals and Departures (Q3186540) (← links)
- The Power of Deferral: Maintaining a Constant-Competitive Steiner Tree Online (Q3460333) (← links)
- On-line path computation and function placement in SDNs (Q5920222) (← links)