构建TSP,如果C上遍历一个vertex两次,则跳过这个vertex直接visit下一个vertex 2-Approximation algorithm C^*是optimal tour的开销,必然有 MST\leq C^* 这是因为C^*移除一条边必然构成G的生成树,因此 Cost(Eulerian\ tour)\leq 2C^*\\ Cost(final\ output)\leq 2C^* 1.5 approximation algorithm of TSP Al...
We present the first polynomial-time 2-approximation algorithm to solve this problem. Empirical tests suggest that the average performance is in fact better than 2.Johannes FischerSimon W. GinzingerAlgorithms-ESA 2005: 13th Annual European Symposium on Algorithms(ESA 2005) October 3-6, 2005 Palma...
We present a polynomial-time algorithm approximating the minimum weight edge dominating set problem within a factor of 2. It has been known that the problem is NP-hard but, when edge weights are uniform (so that the smaller the better), it can be efficiently approximated within a factor of...
A fast algorithm for maximizing a non-monotone DR-submodular integer lattice function - ScienceDirect In this paper we consider the problem of maximizing a non-monotone and non-negative DR-submodular function on a bounded integer lattice [B→]={(x1,…,xn)∈... Q Nong,J Fang,S Gong,......
百度试题 题目For problem X, a 2-approximation algorithm is also a 3-approximation algorithm.相关知识点: 试题来源: 解析 正确 反馈 收藏
The first algorithm has an approximation ratio of ${3/2+frac{6}{n-4}}$ in the case that n/2 is odd, and of ${3/2+frac{5}{n-1}}$ in the case that n/2 is even. Furthermore, we show that this algorithm is applicable to real world problems as it yields close to optimal ...
We give a (1+ln2)-approximation algorithm for trees of constant radius. Our algorithm is based on a new decomposition of problem feasible solutions, and on an extension of Steiner Tree technique of Zelikovsky to the Set-Cover problem, which may be of independent interest....
Chenchen Wu, Dachuan Xu, Dongmei Zhang& Peng Zhang 433Accesses Explore all metrics Abstract In this work, we consider the robust/soft-capacitated 2-level facility location problems. For the robust version, we propose a primal-dual based(3+ϵ)-approximation algorithm via construction of an ada...
For general planar graphs, if the problem is a maximization problem, such as maximum independent set, this technique gives for each k a linear time algorithm that produces a solution whose size is at least (k-1)/k optimal. If the problem is a minimization problem, such as minimum vertex ...
A new and fast algorithm of parameter approaching is pr oposed by analyzing the three methods of linear fitting based on residue rule. 对三种基于残差准则的直线拟合方法进行分析并提出了一种直线拟合快速实现的新算法——参数逼近法;算法以变步长对斜率和截距进行逼近,降低了利用计算机进行直线拟合的复杂度...