Titlebook: Approximation and Online Algorithms; 6th International Wo Evripidis Bampis,Martin Skutella Conference proceedings 2009 Springer-Verlag Berl

characteristic

Allergic

Cooperation in Multiorganization Matchingrganization can be penalized, we study the problem of maximizing the overall profit such that no organization gets less than it can obtain on its own. Complexity results, an approximation algorithm and a matching inapproximation bound are given.

引起痛苦

Randomized Algorithms for Buffer Management with 2-Bounded Delay is that of randomized algorithms against adaptive adversaries. For this case, we give a complete solution by proving that the optimal competitive ratio is 4/3. Additionally, we give a?lower bound of 1.2 for the 2-uniform case.

細(xì)胞膜

注意

Max-Weight Integral Multicommodity Flow in Spiders and High-Capacity Treesterminals, and the objective is to find a max-weight integral flow between terminal pairs subject to the capacities. This problem was shown to be .-hard by Garg, Vazirani and Yannakakis [Algorithmica, 1997], and a 4-approximation was given by Chekuri, Mydlarz and Shepherd [ACM Trans. Alg., 2007]. So

背心

背帶

彈藥

A Lower Bound for Scheduling of Unit Jobs with Immediate Decision on Parallel Machinesbefore their deadlines. We prove a new lower bound for online algorithms with immediate decision. This means that the jobs arrive over time and the algorithm has to decide the schedule of each job immediately upon its release. Our lower bound tends to ./(.???1)?≈?1.58 for many machines, matching the

manifestation

neolith