Polynomial-time approximation schemes for packing and piercing fat objects - CHAN () Citation Context ...et of orthogonal segments in � � [14]. For unit disks in � � , a polynomial time ��������� -approximation scheme was proposed in [13]. For arbitrary...
Polynomial time approximation schemeLatency Bounded Information Propagation (-LBIP) problem in wireless networks which are represented by unit-disk graphs. So far, no guaranteed approximation algorithm has been achieved for -LBIP when ≥2. In this paper, we propose a Polynomial Time Approximation ...
网络两个多项式时间近似方案 网络释义 1. 两个多项式时间近似方案 ...t]和[min-makespan],我们分别设计了两个多项式时间近似方案(Polynomial Time Approximation Scheme),A_k和B_k。 cdmd.cnki.com.cn|基于2个网页
In this study, we consider the probability maximizing shortest path problem (PSP). The problem is to find a simples−tpath that maximizes the probability of arriving at the destination within a given time budgetb, when the travel timelafollows an independent normal distributionN(μa,σa2). T...
Mustafa, N.H., Raman, R., Ray, S.: Quasi-polynomial time approximation scheme for weighted geometric set cover on pseudodisks and halfspaces. SIAM J. Comput.44(6), 1650–1669 (2015) MathSciNetGoogle Scholar Plackett, R.: The analysis of permutations. Appl. Stat. 193–202 (1975) ...
网络完全多项式时间近似方案 网络释义 1. 完全多项式时间近似方案 ...n两者的多项式, 则称其为完全多项式时间近似方案完全多项式时间近似方案(fully polynomial time approximation scheme… www.docin.com|基于 1 个网页
单词 Fully polynomial time approximation scheme 释义 SeeFPTAS 随便看 BFA(CS) BFACT BFAD BFAF BFAFH BFAG BFAH BFAI BFAIR BFAK BFALT BFAM BFAME BFAO BFAP BFAR BFARC BfArM BFARU BFAS BFASA BFASG BFASS BFAST BFAU英汉缩略语词收录了1186255条英文缩写词条,提供最新英文缩写(缩略词)查询及其...
K. Jansen and R. Solis-Oba. An asymptotic fully polynomial time approximation scheme for bin covering. Theoretical Computer Science, 306(1-3):543-551, 2003.K. Jansen, Scheduling malleable parallel tasks: an asymptotic fully polynomial time approximation scheme, Proc. 10th Ann. European Symp. ...
2) polynomial time approximation scheme 多项式时间近似方案 1. We construct an new 2 dimension networks based on the given networks, using the algorithm of restricted shortest path problem, we then give apolynomial time approximation schemefor this problem with two pair of points. ...
2) polynomial time approximation scheme 多项式时间近似方案 1. We construct an new 2 dimension networks based on the given networks, using the algorithm of restricted shortest path problem, we then give a polynomial time approximation scheme for this problem with two pair of points. 本文设法在...