a06-chap5-rand 算法导论 讲解材料.pptVIP

1 Explain the difference between probabilistic analysis and randomized algorithms. （概率分析与随机算法） Present the technique of indicator random variables. （用指示(器)随机变量来对算法进行概率分析） Give another example of a randomized algorithm. （一个随机算法实例） 5 Probabilistic Analysis and Randomized Algorithms 2 3 4 5 5.1 The hiring problem Scenario（情景）:hire the best office assistant in a month You are using an employment agency to hire a new office assistant. （猎头（代理）公司帮你物色办公助理候选人） The agency sends you one candidate each day. (1,2,...,n表示候选人的编号，红色圆圈候选人的工作能力) You interview the candidate and must immediately decide whether or not to hire him. But if you hire, you must also fire your current one. …… Agency Officer C n j 2 1 … 8 5.1.1 Worst-case analysis Cost: n candidates, we hire m of them, cost is T(n) = nci+mch We focus on analyzing the hiring cost mch? ( ch ci ) mch varies with each run: it depends on the order in which we interview the candidates. Worst-case analysis We hire all n candidates. T(n) = nci+nch? When? The candidates appear in increasing order of qulity. Agency Officer C n j 2 1 … n 3 2 … 1 In a month, T(30) = 30 + 30*10 = 330 K 9 5.1.2 Propbabilistic analysis Assume that candidates come in a random order: Assign a rank to each candidate: rank(i) is a unique integer in the range 1 to n. （对每一个候选人分配一个“名次”） The list rank(1), …, rank(n) is a permutation of the candidate numbers 1, …, n, such as 5, 2, 1, 28, 9, … , 11 The ranks form a uniform random permutation: each of the possible n! permutations appears with equal probability 1 n 3 2 … 10 5.1.2 Propbabilistic analysis Essential idea of probabilistic analysis: We must use knowledge of, or make assumptions about, the distribution of inputs. （概率分析的本质：需已知或假定输入的概率分布） The expectation is taken over this distribution. （依据概率分布来求期望，期望值即是平均 hire 的人数） Section 5.2 contains a probabilistic analysis of the hiring problem. HIRE-ASSISTANT(n) cost times best ← 0 // candidate 0 is a least-qualified dummy candidate for i ←