矛盾心理
发表于 2025-3-28 15:10:57
On the Axiomatizability of Ready Traces, Ready Simulation, and Failure Traceshabet of actions is finite, then there exists a (sound and complete) finite equational axiomatization for the process algebra BCCSP modulo ready trace semantics. We prove that if the alphabet is infinite, then such an axiomatization does not exist. Furthermore, we present finite equational axiomatiz
存心
发表于 2025-3-28 20:31:53
http://reply.papertrans.cn/17/1663/166212/166212_42.png
Spongy-Bone
发表于 2025-3-29 00:46:26
http://reply.papertrans.cn/17/1663/166212/166212_43.png
奇思怪想
发表于 2025-3-29 05:24:19
http://reply.papertrans.cn/17/1663/166212/166212_44.png
inculpate
发表于 2025-3-29 11:13:58
An Improved Approximation Algorithm for the Asymmetric TSP with Strengthened Triangle Inequality .(.) ≤ . · (.(.) + .(.)) for all nodes .. Chandran and Ram [.] recently gave the first constant factor approximation algorithm with polynomial running time for this problem. They achieve performance ratio ./1−.. We devise an approximation algorithm with performance ratio ., which is better than the
Needlework
发表于 2025-3-29 11:50:06
http://reply.papertrans.cn/17/1663/166212/166212_46.png
愤世嫉俗者
发表于 2025-3-29 16:55:10
Approximation Schemes for Degree-Restricted MST and Red-Blue Separation Problemfor approximating TSP. Given . points in the plane, . = 2 or 3, and . > 0, the scheme finds an approximation with cost within 1 + . of the lowest cost spanning tree with the property that all nodes have degree at most .. We also develop a polynomial time approximation scheme for the Euclidean versio
储备
发表于 2025-3-29 21:11:51
Approximating Steiner ,-Cutsrected graph . = (.), a subset of vertices ... called ., and an integer . ≤ |.|, the objective is to find a minimum weight set of edges whose removal results in . disconnected components, each of which contains at least one terminal. We give two approximation algorithms for the problem: a 2 − 2/.-ap
间谍活动
发表于 2025-3-30 00:34:13
http://reply.papertrans.cn/17/1663/166212/166212_49.png
唤起
发表于 2025-3-30 06:57:16
Approximation Algorithm for Directed Telephone Multicast Problemdiscrete “rounds”, and in every round every processor is allowed to pick one of its neighbors, and to send him a message. The . problem requires to compute a schedule with minimal number of rounds that delivers a message from a given single processor, that generates the message, to all the processor