The following pages link to (Q4252723):
Displayed 21 items.
- How to allocate goods in an online market? (Q262246) (← links)
- Tight bounds for parallel randomized load balancing (Q287991) (← links)
- An efficient polynomial time approximation scheme for load balancing on uniformly related machines (Q463715) (← links)
- Online scheduling with rejection and reordering: exact algorithms for unit size jobs (Q489737) (← links)
- Tight bounds for selfish and greedy load balancing (Q644806) (← links)
- A unifying tool for bounding the quality of non-cooperative solutions in weighted congestion games (Q722221) (← links)
- Competitive online multicommodity routing (Q839644) (← links)
- The hierarchical model for load balancing on two machines (Q927189) (← links)
- An almost ideal coordination mechanism for unrelated machine scheduling (Q1733383) (← links)
- Local base station assignment with time intervals in mobile computing environments (Q1877045) (← links)
- A PTAS for a class of binary non-linear programs with low-rank functions (Q2060337) (← links)
- Online covering with \(\ell_q\)-norm objectives and applications to network design (Q2205975) (← links)
- Efficient coordination mechanisms for unrelated machine scheduling (Q2375956) (← links)
- The benefit of preemption with respect to the \(\ell_p\) norm (Q2417189) (← links)
- A Unified Approach to Truthful Scheduling on Related Machines (Q2800378) (← links)
- Tight Bounds for Online Vector Scheduling (Q4620410) (← links)
- (Q5111703) (← links)
- Hallucination Helps: Energy Efficient Virtual Circuit Routing (Q5210552) (← links)
- Nonadaptive Selfish Routing with Online Demands (Q5458504) (← links)
- Price of anarchy for parallel link networks with generalized mean objective (Q6103184) (← links)
- Approximation schemes for packing problems with \(\ell_p\)-norm diversity constraints (Q6109005) (← links)