共查询到20条相似文献,搜索用时 27 毫秒
1.
2.
3.
4.
5.
6.
7.
8.
9.
10.
11.
12.
13.
14.
15.
A note on two source location problems 总被引:1,自引:1,他引:0
We consider Source Location () problems: given a capacitated network , cost and a demand for every , choose a min-cost so that holds for every , where is the maximum flow value from v to S. In the directed variant, we have demands and and we require and . Undirected is (weakly) NP-hard on stars with for all v except the center. But, it is known to be polynomially solvable for uniform costs and uniform demands. For general instances, both directed an undirected admit a -approximation algorithms, where D is the sum of the demands; up to constant this is tight, unless P = NP. We give a pseudopolynomial algorithm for undirected on trees with running time , where . This algorithm is used to derive a linear time algorithm for undirected with . We also consider the Single Assignment Source Location () where every should be assigned to a single node . While the undirected is in P, we give a -approximation algorithm for the directed case, and show that this is tight, unless P = NP. 相似文献
16.
17.
18.
In this paper, we prove the Hamilton differential Harnack inequality for positive solutions to the heat equation of the Witten Laplacian on complete Riemannian manifolds with the -condition, where and are two constants. Moreover, we introduce the W-entropy and prove the W-entropy formula for the fundamental solution of the Witten Laplacian on complete Riemannian manifolds with the -condition and on compact manifolds equipped with -super Ricci flows. 相似文献
19.