Publication:4252723
From MaRDI portal
zbMath0938.68509MaRDI QIDQ4252723
No author found.
Publication date: 26 April 2000
68M07: Mathematical problems of computer architecture
Related Items
Tight Bounds for Online Vector Scheduling, Unnamed Item, Hallucination Helps: Energy Efficient Virtual Circuit Routing, Nonadaptive Selfish Routing with Online Demands, Price of anarchy for parallel link networks with generalized mean objective, Approximation schemes for packing problems with \(\ell_p\)-norm diversity constraints, How to allocate goods in an online market?, Tight bounds for parallel randomized load balancing, An efficient polynomial time approximation scheme for load balancing on uniformly related machines, Online scheduling with rejection and reordering: exact algorithms for unit size jobs, Tight bounds for selfish and greedy load balancing, A unifying tool for bounding the quality of non-cooperative solutions in weighted congestion games, Competitive online multicommodity routing, The hierarchical model for load balancing on two machines, An almost ideal coordination mechanism for unrelated machine scheduling, Local base station assignment with time intervals in mobile computing environments, A PTAS for a class of binary non-linear programs with low-rank functions, Online covering with \(\ell_q\)-norm objectives and applications to network design, Efficient coordination mechanisms for unrelated machine scheduling, The benefit of preemption with respect to the \(\ell_p\) norm, A Unified Approach to Truthful Scheduling on Related Machines
