机动车安全技术检验机构检验.pptVIP

Shifting 3 a/(2(h+1)) = integer Time=n O(a ) 2 h=2 Weighted Dominating Set Given a unit disk graph with vertex weight, find a dominating set with minimum total weight. Can the partition technique be used for the weighted dominating set problem? Dominating Set in Intersection Disk Graph An intersection disk graph is given by a set of points (vertices) in the Euclidean plane, each associated with a disk and an edge exists between two points iff two disks associated with them intersects. Can the partition technique be used for dominating set in intersection disk graph? Thanks, End Chapter 4 Partition (1) Shifting Ding-Zhu Du 汽车防盗器 Disk Covering Given a set of n points in the Euclidean plane, find the minimum number of unit disks to cover the n given points. (x,x) Partition P(x) a Construct Minimum Unit Disk Cover in Each Cell 1/√2 Each square with edge length 1/√2 can be covered by a unit disk. Hence, each cell can be covered By at most disks. Suppose a cell contains ni points. Then there are ni(ni-1) possible positions for each disk. Minimum cover can be computed In time ni O(a ) 2 Solution S(x) associated with P(x) For each cell, construct minimum cover. S(x) is the union of those minimum covers. Suppose n points are distributed into k cells containing n1, …, nk points, respectively. Then computing S(x) takes time n1 + n2 + ··· + nk n O(a ) O(a ) O(a ) O(a ) 2 2 2 2 Approximation Algorithm For x=0, -2, …, -(a-2), compute S(x). Choose minimum one from S(0), S(-2), …, S(-a+2). Analysis Consider a minimum cover. Modify it to satisfy the restriction, i.e., a union of disk covers each for a cell. To do such a modification, we need to add some disks and estimate how many added disks. Added Disks Count twice Count four times 2 2 Shifting Estimate # of added disks Shifting Estimate # of added disks Vertical strips Each disk appears once. Estimate # of added disks Horizontal strips Each disk appears once. Estimate # o