共查询到20条相似文献,搜索用时 15 毫秒
1.
Let be a simple undirected graph with a set V of vertices and a set E of edges. Each vertex has a demand , and a cost , where and denote the set of nonnegative integers and the set of nonnegative reals, respectively. The source location problem with vertex-connectivity requirements in a given graph G asks to find a set S of vertices minimizing such that there are at least pairwise vertex-disjoint paths from S to v for each vertex . It is known that the problem is not approximable within a ratio of , unless NP has an -time deterministic algorithm. Also, it is known that even if every vertex has a uniform cost and holds, then the problem is NP-hard, where .In this paper, we consider the problem in the case where every vertex has uniform cost. We propose a simple greedy algorithm for providing a -approximate solution to the problem in time, while we also show that there exists an instance for which it provides no better than a -approximate solution. Especially, in the case of , we give a tight analysis to show that it achieves an approximation ratio of 3. We also show the APX-hardness of the problem even restricted to . 相似文献
2.
3.
《Discrete Mathematics》2007,307(17-18):2226-2234
4.
5.
6.
7.
8.
9.
Ideal matrices are precisely those matrices M where the set covering polyhedron equals the polyhedron . In a previous work (2006) we defined a nonidealness index equivalent to . Given an arbitrary matrix M the nonideal index is NP-hard to compute and for most matrices it remains unknown.A well known family of minimally nonideal matrices is the one of the incidence matrices of chordless odd cycles. A natural generalization of them is given by circulant matrices. Circulant ideal matrices have been completely identified by Cornuéjols and Novick (1994). In this work we obtain a bound for the nonidealness index of circulant matrices and determine it for some particular cases. 相似文献
10.
11.
12.
13.
《Advances in Applied Mathematics》2009,42(4):510-529
We consider the situation that M and N are 3-connected matroids such that and is a cocircuit of M with the property that has an N-minor for some . We show that either there is an element such that or is 3-connected with an N-minor, or there is a four-element fan of M that contains two elements of and an element x such that is 3-connected with an N-minor. 相似文献
14.
15.
16.
17.
19.