The following pages link to On-line load balancing (Q1331958):
Displaying 29 items.
- An improved lower bound for load balancing of tasks with unknown duration (Q287100) (← links)
- Fair online load balancing (Q398848) (← links)
- A generalization of Hungarian method and Hall's theorem with applications in wireless sensor networks (Q412342) (← links)
- Tight bounds for online class-constrained packing (Q596145) (← links)
- Improved bounds for online scheduling with eligibility constraints (Q719259) (← links)
- On-line load balancing made simple: greedy strikes back (Q924556) (← links)
- On the \(k\)-orientability of random graphs (Q1024456) (← links)
- Improved bounds for on-line load balancing (Q1283679) (← links)
- On-line load balancing and network flow (Q1393068) (← links)
- On-line algorithms for the channel assignment problem in cellular networks. (Q1427805) (← links)
- Resource augmentation in load balancing. (Q1588053) (← links)
- Competitive on-line scheduling of continuous-media streams (Q1608317) (← links)
- Offline file assignments for online load balancing (Q1944067) (← links)
- Online load balancing with general reassignment cost (Q2157902) (← links)
- Competitive strategies for an online generalized assignment problem with a service consecution constraint (Q2355803) (← links)
- On-line load balancing in a hierarchical server topology (Q2784469) (← links)
- Online client-server load balancing without global information (Q2921671) (← links)
- On-Line Load Balancing of Temporary Tasks (Q3125220) (← links)
- The load balancing problem (Q3307329) (← links)
- An Equivalent Version of the Caccetta-Häggkvist Conjecture in an Online Load Balancing Problem (Q3508564) (← links)
- Online and Random-order Load Balancing Simultaneously (Q4575851) (← links)
- Balancing sums of random vectors (Q4645029) (← links)
- On-Line Load Balancing of Temporary Tasks on Identical Machines (Q4652641) (← links)
- Load Balancing for Response Time (Q4953243) (← links)
- Online load balancing of temporary tasks (Q5060106) (← links)
- Approximation and Online Algorithms (Q5896922) (← links)
- Greedy is optimal for online restricted assignment and smart grid scheduling for unit size jobs (Q5919098) (← links)
- Ancient and new algorithms for load balancing in the \(\ell_p\) norm (Q5930157) (← links)
- Load balancing for response time (Q6102313) (← links)
