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影響因子(影響力)學(xué)科排名




書目名稱Combinatorial Optimization and Applications網(wǎng)絡(luò)公開度




書目名稱Combinatorial Optimization and Applications網(wǎng)絡(luò)公開度學(xué)科排名




書目名稱Combinatorial Optimization and Applications被引頻次




書目名稱Combinatorial Optimization and Applications被引頻次學(xué)科排名




書目名稱Combinatorial Optimization and Applications年度引用




書目名稱Combinatorial Optimization and Applications年度引用學(xué)科排名




書目名稱Combinatorial Optimization and Applications讀者反饋




書目名稱Combinatorial Optimization and Applications讀者反饋學(xué)科排名

尖酸一點(diǎn)

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.