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

保守党

使混合

沉默

Euclidean Chains and Their Shortcuts,dge is the Euclidean distance between its two endpoints. A Euclidean chain . = (..,..,…, ..) is a planar straight line graph with vertex set {..,..,…, ..} and edge set {....: 1 ≤ . ≤ . − 1}. Given a Euclidean chain . in the plane, we study the problem of finding a pair of points on . such that the n

JOT

List Dynamic Coloring of Sparse Graphs,rs. The ... (.) of . is the least integer . such that for every list assignment of size . to each vertex of ., there is a dynamic coloring of . such that each vertex is colored by a color from its list. We proved that .. (.) ≤ 4 if . where Mad (.) is the maximum average degree of .. And .. (.) ≤ 4 i

Indurate

genesis

Progesterone

系列

Minimum Latency Data Aggregation in Wireless Sensor Network with Directional Antenna,e interference. In this paper, we study the minimum latency data aggregation problem with directional antenna model under protocol interference model. We propose an approximation directional data aggregation algorithm to schedule data transmissions, which can save energy and reduce interference to r

Frenetic

Metastasis