Titlebook: Combinatorial Optimization and Applications; 5th International Co Weifan Wang,Xuding Zhu,Ding-Zhu Du Conference proceedings 2011 Springer-V

Jurisdiction

书目名称Combinatorial Optimization and Applications影响因子(影响力)




书目名称Combinatorial Optimization and Applications影响因子(影响力)学科排名




书目名称Combinatorial Optimization and Applications网络公开度




书目名称Combinatorial Optimization and Applications网络公开度学科排名




书目名称Combinatorial Optimization and Applications被引频次




书目名称Combinatorial Optimization and Applications被引频次学科排名




书目名称Combinatorial Optimization and Applications年度引用




书目名称Combinatorial Optimization and Applications年度引用学科排名




书目名称Combinatorial Optimization and Applications读者反馈




书目名称Combinatorial Optimization and Applications读者反馈学科排名

尖酸一点

A Near-Optimal Memoryless Online Algorithm for FIFO Buffering Two Packet Classes,me competitive ratio as the one presented in (Lotker and Patt-Shamir. PODC 2002, Computer Networks 2003). However, our algorithm is simpler and does not employ any marking bits. The idea used in our algorithm is novel and different from all previous approaches applied for the general model and its v

Biguanides

裁决

https://doi.org/10.1007/978-3-030-19396-6me competitive ratio as the one presented in (Lotker and Patt-Shamir. PODC 2002, Computer Networks 2003). However, our algorithm is simpler and does not employ any marking bits. The idea used in our algorithm is novel and different from all previous approaches applied for the general model and its v

秘方药

Erico Przeybilovicz,Maria Alexandra Cunhahat extent. The other is to exploit possibilities of applying algebraic properties of polynomials to the study of those problems. A series of results about ΠΣΠ and ΠΣ polynomials are obtained in this paper, laying a basis for further study along this line.

ANT

ANT

恸哭

Peng Weibin,Fang Liuqing,Lin Xiaojingt three approximation algorithms for computing the optimal shortcuts of chains. One of them is a fully polynomial-time approximation scheme (FPTAS). We introduce two types of chains, strongly monotonic chain and simple chain. We provide properties for these two types of chains and their shortcuts.

决定性

Pamphlet

Euclidean Chains and Their Shortcuts,t three approximation algorithms for computing the optimal shortcuts of chains. One of them is a fully polynomial-time approximation scheme (FPTAS). We introduce two types of chains, strongly monotonic chain and simple chain. We provide properties for these two types of chains and their shortcuts.