APX是approximable(可近似的)的缩写,在复杂度理论中,APX类问题是允许多项式时间近似算法且近似比在常数范围内的NP优化问题的集合,这种多项式时间复杂度且近似比(approximation ratio)在常数范围近似算法也称为constant-factor approximation algorithms。简单来说,这类问题具有在最优结果一定百分比内的高效算法。例如,在装箱...
A Constant-Factor Approximation for Stochastic Steiner Forest ∗ Anupam Gupta Computer Science Dept. Carnegie Mellon University Pittsburgh PA 15213 anupamg@cs.cmu.edu Amit Kumar Dept. of Computer Science and Engineering Indian Institute of Technology ...
We revisit the traveling salesman problem with neighborhoods (TSPN) and present the first constant-ratio approximation for disks in the plane: Given a set of n disks in the plane, a TSP tour whose length is at most O (1) times the optimal can be computed in time that is polynomial in ...
approximation algorithmfor this problem in general graphs. 1 A closely related problem is the quotient vertex-cut problem. The quotient cast of thevertex-cut isdefinedas 2 q(A, B, C) := c(C) min{w(A), w(B)} +w(C) .
This article proposes the first known algorithm that achieves a constant-factor approximation of the minimum length tour for a Dubins' vehicle through $n$ points on the plane. By Dubins' vehicle, we mean a vehicle constrained to move at constant speed along paths with bounded curvature without ...
In this work, we derive a factor 66-approximation algorithm for Tracking Paths in weighted graphs and a factor 4-approximation algorithm if the input is unweighted. This is the first constant factor approximation for this problem. While doing so, we also study approximation of the closely ...
Proceeding in this way it can be obtained a 2-approximation for a wide class of minmax regret optimization models. In this paper it is shown how this approach can be extended to a new class of minmax regret problems including more general uncertainty sets. 展开 ...
This paper proposes a new polynomial time constant factor approximation algorithm for a more-a-decade-long open NP-hard problem, the minimum four-connected m-dominating set problem in unit disk graph (UDG) with any positive integer m ≥ 1 for the first time in the literature. We observe tha...
J Comb OptimDOI 10.1007/s10878-008-9146-0A better constant-factor approximation for weighteddominating set in unit disk graphYaochun Huang ·Xiaofeng Gao ·Zhao Zhang ·Weili Wu© Springer Science+Business Media, LLC 2008Abstract This paper presents a (10 + ε)-approximation algorithm to compute...
系统标签: dominating weighted approximation constant factor better JCombOptim(2009)18:179–194DOI10.1007/s10878-008-9146-0Abetterconstant-factorapproximationforweighteddominatingsetinunitdiskgraphYaochunHuang·XiaofengGao·ZhaoZhang·WeiliWuPublishedonline:1March2008©SpringerScience+BusinessMedia,LLC2008Abstract...