休闲
发表于 2025-3-28 17:45:57
http://reply.papertrans.cn/28/2800/279934/279934_41.png
kindred
发表于 2025-3-28 20:49:51
Approximation Algorithms for Path Coloring in Trees present hardness results and lower bounds for the general problem covering also the special case of sets of symmetric paths (corresponding to the important case of symmetric communication). We give an overview of the main ideas of deterministic greedy algorithms and point out their limitations. For