易碎
发表于 2025-3-30 08:22:01
http://reply.papertrans.cn/103/10201/1020031/1020031_51.png
Arthritis
发表于 2025-3-30 12:41:32
http://reply.papertrans.cn/103/10201/1020031/1020031_52.png
谦卑
发表于 2025-3-30 18:35:28
http://reply.papertrans.cn/103/10201/1020031/1020031_53.png
conference
发表于 2025-3-30 21:22:53
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.
挑剔为人
发表于 2025-3-31 00:57:19
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
发表于 2025-3-31 06:49:10
http://reply.papertrans.cn/103/10201/1020031/1020031_56.png
Allowance
发表于 2025-3-31 11:30:31
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 ) to obtain an improved solution.
仔细检查
发表于 2025-3-31 14:14:24
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
发表于 2025-3-31 18:09:46
http://reply.papertrans.cn/103/10201/1020031/1020031_59.png
tackle
发表于 2025-4-1 00:28:29
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.