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