Titlebook: WALCOM: Algorithms and Computation; 9th International Wo M. Sohel Rahman,Etsuji Tomita Conference proceedings 2015 Springer International P

Integrate

Lobotomy

The Directed Ring Loading with Penalty Costation algorithm for the demand divisible case and a 3-approximation algorithm for the demand indivisible case, respectively. As a consequence, for any .?>?0, we present a (1.582?+?.)-approximation algorithm for the case where every multicast request contains exactly one sink.

記憶

Edge-Colorings of Weighted Graphs present various upper and lower bounds on the .-chromatic index, and obtain three efficient algorithms to find an .-edge-coloring of a given graph. One of them finds an .-edge-coloring with span smaller than twice the .-chromatic index.

CLEAR

An Almost Optimal Algorithm for Voronoi Diagrams of Non-disjoint Line Segmentslog.?+?.) in the worst case, our algorithm is worst-case optimal for .?=?Ω(. .(.) log.), and is only a factor of .(.) away from the lower bound. For the purpose, we also present an improved algorithm that computes the medial axis or the Voronoi diagram of a polygon with holes.

要素

Fault-Tolerant Gathering of Asynchronous Oblivious Mobile Robots under One-Axis Agreement we have proved that gathering of asynchronous robots is possible with less number of such assumptions and even in the presence of any number of faulty robots. In our case, the robots only agree on the direction and orientation of any one axis.