intoxicate 发表于 2025-3-23 10:41:30
Fair Packing of Independent Setsrent profit valuations of items and we allow an incompatibility relation between pairs of items described in terms of a conflict graph. Hence, every feasible allocation of items to the agents corresponds to a partial coloring, that is, a collection of pairwise disjoint independent sets. The sum of pONYM 发表于 2025-3-23 16:34:34
Polynomial Time Algorithms for Tracking Path Problemsuence of trackers encountered in each .-. path is unique. . is .-hard in both directed and undirected graphs in general. In this paper we give a collection of polynomial time algorithms for some restricted versions of .. We prove that . is polynomial time solvable for chordal graphs and tournament g极小量 发表于 2025-3-23 20:28:34
http://reply.papertrans.cn/23/2299/229884/229884_13.png不理会 发表于 2025-3-23 23:42:44
Iterated Type Partitionsth and neighborhood diversity. We prove that the Equitable Coloring problem is W-hard when parametrized by the iterated type partition. This result extends to modular-width, answering an open question on the complexity of Equitable Coloring when parametrized by modular-width. On the contrary, weKindle 发表于 2025-3-24 05:43:10
Two Robots Patrolling on a Line: Integer Version and Approximabilityimal waiting time between two visits. The problem is to construct an optimal schedule for the robots. While the one-robot problem is easy to solve in linear time, already for two robots the complexity is open. Chuangpishit, Czyzowicz, Gasieniec, Georgiou, Jurdzinski, and Kranakis (SOFSEM 2018) found注视 发表于 2025-3-24 08:44:15
http://reply.papertrans.cn/23/2299/229884/229884_16.pnghappiness 发表于 2025-3-24 14:22:59
http://reply.papertrans.cn/23/2299/229884/229884_17.pngMEN 发表于 2025-3-24 18:26:35
https://doi.org/10.1007/978-3-540-46055-8rom minuscule particles all the way to far-away satellite swarms. Particular results include methods for coordinating the motion of vehicles in traffic in order to avoid inefficient stop-and-go congestions; using uniform global forces for controlling particle swarms; online triangulation and structu地名词典 发表于 2025-3-24 21:32:08
https://doi.org/10.1007/978-3-540-46055-8present interesting biological events, such as alternative splicing (AS) and allelic differences (SNPs and indels). However, the set of all bubbles in a de Bruijn graph built from real data is usually too large to be efficiently enumerated and analysed in practice. In particular, despite significant摇晃 发表于 2025-3-25 00:51:48
http://reply.papertrans.cn/23/2299/229884/229884_20.png