An Iterative Round- ing 2-approximation Algorithm for the Element Connectiv- ity Problem. Proceedings of FOCS 2001, 339-347.L. Fleischer, K. Jain, and D. P. Williamson. An Iterative Rounding 2-Approximation Algorithm for the Element Con- nectivity Problem. In Proc. of the IEEE Symp. on ...
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...
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...
百度试题 题目For problem X, a 2-approximation algorithm is also a 3-approximation algorithm.相关知识点: 试题来源: 解析 正确 反馈 收藏
构建TSP,如果C上遍历一个vertex两次,则跳过这个vertex直接visit下一个vertex 2-Approximation algorithm C∗是optimal tour的开销,必然有 MST≤C∗ 这是因为C∗移除一条边必然构成G的生成树,因此 Cost(Euleriantour)≤2C∗Cost(finaloutput)≤2C∗ ...
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,......
See =-=[20]-=- for a survey. The online bipartite matching problem was first studied in the seminal paper by Karp et al. [13] and an optimal 1 − 1/e competitive online algorithm was obtained. Katriel et al. [14] co...
In the Euclidean TSP with neighborhoods (TSPN), we are given a collection of regions ((1)-approximation algorithm for the case of neighborhoods that are (i... A Dumitrescu,JSB Mitchell - 《Journal of Algorithms》 被引量: 389发表: 2003年 Approximation algorithms for orienteering and discounted...
Alth¨ofer et al. [1] designed a simple greedy algorithm that for an arbitrary graph G computes an s -spanner H of G for any s > 1. In the case of planar graphs, it is shown in [1] that this spanner has weight w ( H
A new and fast algorithm of parameter approaching is pr oposed by analyzing the three methods of linear fitting based on residue rule. 对三种基于残差准则的直线拟合方法进行分析并提出了一种直线拟合快速实现的新算法——参数逼近法;算法以变步长对斜率和截距进行逼近,降低了利用计算机进行直线拟合的复杂度...