Titlebook: WALCOM: Algorithms and Computation; 7th International Wo Subir Kumar Ghosh,Takeshi Tokuyama Conference proceedings 2013 Springer-Verlag Ber

易碎

Arthritis

謙卑

conference

Voronoi Game on Graphsnstant number of facilities and provided an algorithm for the same. Next we have proved that finding the optimal placement of . facilities by Player 2 is .-hard where . is given. Lastly we presented a 1.58 factor approximation algorithm for the above mentioned problem.

挑剔為人

Voronoi Game on Graphsnstant number of facilities and provided an algorithm for the same. Next we have proved that finding the optimal placement of . facilities by Player 2 is .-hard where . is given. Lastly we presented a 1.58 factor approximation algorithm for the above mentioned problem.

Communal

Allowance

Approximation Schemes for Covering and Packingmportant problem where one has to find a minimum-cardinality subset of a given set of disks (of varying radii) that covers a given set of points, and apply it to a class cover problem (studied in [3]) to obtain an improved solution.

仔細(xì)檢查

Daemon Conversions in Distributed Self-stabilizing Algorithmsm to any other daemon when needed. We give the first (full) proof that, provided there are IDs, any algorithm that self-stabilizes only under a fair central daemon can be converted to one that self-stabilizes under an unfair read/write daemon.

gentle

tackle

Triangle-Partitioning Edges of Planar Graphs, Toroidal Graphs and ,-Planar GraphsWe consider the question whether the edges of a graph can be partitioned into a set of triangles. We propose a linear-time algorithm to partition the edges of a planar graph into triangles. We also obtain a polynomial-time algorithm for toroidal graphs. On the other hand, we show that it is NP-complete for .-planar graphs, where .?≥?8.