Reverie
发表于 2025-3-28 15:08:41
http://reply.papertrans.cn/17/1605/160457/160457_41.png
ALERT
发表于 2025-3-28 22:09:09
https://doi.org/10.1007/BFb0113620 relay triangulation problem (MRTP) asks for placing a minimum number of robots, such that their communication graph is a triangulated cover of the region. The maximum area triangulation problem (MATP) aims at finding a placement of . robots such that their communication graph contains a root and fo
Texture
发表于 2025-3-29 00:57:57
http://reply.papertrans.cn/17/1605/160457/160457_43.png
经典
发表于 2025-3-29 06:19:06
,Klothilde Gollwitzer-Meier 1894–1954,itated problem is closely related to that of the uncapacitated version. We also give related lower bounds, and show that the hereditary property is necessary to obtain non-trivial results. Finally, we give some results for capacitated covering problems on set systems with low hereditary discrepancy and low VC dimension.
向外供接触
发表于 2025-3-29 10:28:18
https://doi.org/10.1007/BFb0117000major open problem in network design. We give a (1 + ln 2)-approximation algorithm for trees of constant radius. Our algorithm is based on a new decomposition of problem solutions, which may be of independent interest.
姑姑在炫耀
发表于 2025-3-29 15:19:15
http://reply.papertrans.cn/17/1605/160457/160457_46.png
和蔼
发表于 2025-3-29 17:12:17
http://reply.papertrans.cn/17/1605/160457/160457_47.png
Plaque
发表于 2025-3-29 21:34:28
The biosynthesis of the purines,ng a tree .-spanner. For the latter result we use a new necessary condition for a graph to have a tree .-spanner: if a graph . has a tree .-spanner, then . admits a Robertson-Seymour’s tree-decomposition with bags of radius at most ⌈./2⌉ in ..
Obverse
发表于 2025-3-30 02:11:59
Mucosaccharides and glycoproteins,e barrier is restricted to the interior and the boundary of the input polygon, then the problem admits a fully polynomial-time approximation scheme for the connected case and a quadratic-time exact algorithm for the single-arc case. These are the first approximation algorithms obtained for this problem.
弹药
发表于 2025-3-30 06:05:18
Bandwidth and Low Dimensional Embeddingbstantially increasing the distortion. As we observe that the family of graphs with bounded bandwidth are doubling, our result can be viewed as a positive answer to a conjecture of Assouad , limited to this family. We also study an extension to graphs of bounded tree-bandwidth.