请问mm们都在哪里买日韩的化妆品# Fashion - 美丽时尚
o*i
1 楼
Consider a straight highway in the plane which can be modelled by a
horizontal strip in the plane. A finite set T of targets are located on the
highway, and a finite set S of wireless sensors are located outside of the
highway. A sensor s can monitor a target t if and only if the Euclidean
distance between s and t is at most one. Suppose that each sensor s has a
positive cost c and each target t can be monitored by at least one sensor in
S. Consider a subset S1 of sensors in S. S1 is said to be a cover if each
target in T is covered by at least one sensor in S1. The cost of S0 is the
total costs of the sensors in S0. The objective is to compute a cover S0 of
minimum cost. Please develop a polynomial time algorithm and write program
to implement it
是作业题，大家给我个思路吧..
horizontal strip in the plane. A finite set T of targets are located on the
highway, and a finite set S of wireless sensors are located outside of the
highway. A sensor s can monitor a target t if and only if the Euclidean
distance between s and t is at most one. Suppose that each sensor s has a
positive cost c and each target t can be monitored by at least one sensor in
S. Consider a subset S1 of sensors in S. S1 is said to be a cover if each
target in T is covered by at least one sensor in S1. The cost of S0 is the
total costs of the sensors in S0. The objective is to compute a cover S0 of
minimum cost. Please develop a polynomial time algorithm and write program
to implement it
是作业题，大家给我个思路吧..
