List's worst-average-case or WAC ratio
نویسندگان
چکیده
We analyze the List scheduling algorithm for the problem of minimizing makespan using a worst-average-case or wac analysis technique, previously used by Kenyon for analyzing the Best Fit bin packing algorithm. We show that List’s worst-average-case or wac ratio asymptotically approaches 2 as m→∞. Thus, List’s worst-case behavior is not overly dependent on the order of job arrivals.
منابع مشابه
Smoothed and Average-Case Approximation Ratios of Mechanisms: Beyond the Worst-Case Analysis
The approximation ratio has become one of the dominant measures in mechanism design problems. In light of analysis of algorithms, we define the smoothed approximation ratio to compare the performance of the optimal mechanism and a truthful mechanism when the inputs are subject to random perturbations of the worst-case inputs, and define the average-case approximation ratio to compare the perfor...
متن کاملN ov 2 01 7 Average - case Approximation Ratio of Scheduling without Payments
Apart from the principles and methodologies inherited from Economics and Game Theory, the studies in Algorithmic Mechanism Design typically employ the worst-case analysis and approximation schemes of Theoretical Computer Science. For instance, the approximation ratio, which is the canonical measure of evaluating how well an incentive-compatible mechanism approximately optimizes the objective, i...
متن کاملAverage-case Approximation Ratio of Scheduling without Payments
Apart from the principles and methodologies inherited from Economics and Game Theory, the studies in Algorithmic Mechanism Design typically employ the worst-case analysis and approximation schemes of Theoretical Computer Science. For instance, the approximation ratio, which is the canonical measure of evaluating how well an incentive-compatible mechanism approximately optimizes the objective, i...
متن کاملThe Ordered Open-End Bin-Packing Problem
We study a variant of the classical bin-packing problem, the ordered open-end bin-packing problem, where first a bin can be filled to a level above 1 as long as the removal of the last piece brings the bin’s level back to below 1 and second, the last piece is the largest-indexed piece among all pieces in the bin. We conduct both worst-case and average-case analyses for the problem. In the worst...
متن کاملAn Approach for Worst Case Analysis of Heuristics: Analysis of a Flexible 0-1 Knapsack Problem
We introduce one technique for worst case analysis of heuristics. We use functions of continuous variables determined by the input data to represent the ratio of the solution value generated by an approximate algorithm(or a lower bound on it) over an upper bound on the optimal solution value. We then use standard mathematical techniques to analyze the fUlldion corresponding to the performance r...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. Scheduling
دوره 11 شماره
صفحات -
تاریخ انتشار 2008