粗糙
发表于 2025-3-30 08:19:23
Molecular Basis of Hematopoiesisen graphs, and (7,3)-graphs. Moreover, split-perfect graphs form a new subclass of brittle graphs containing the superbrittle graphs for which a new characterization is obtained leading to linear time recognition.
车床
发表于 2025-3-30 12:40:49
On the Expected Runtime and the Success Probability of Evolutionary Algorithms (Invited Presentatioues are necessary. Two such results are presented. First, it is shown that the most simple evolutionary algorithm optimizes each pseudo-boolean linear function in an expected time of O(. log .). Second, an example is shown where crossover decreases the expected runtime from superpolynomial to polynomial.
抗体
发表于 2025-3-30 18:13:48
Approximating Call-Scheduling Makespan in All-Optical Networks,s of rings. As a side result, we present a constant approximation algorithm for star networks. We assume for simplicity that all calls are released at time 0, however all our results hold also for arbitrary release dates at the expense of a factor 2 in the approximation ratio.
露天历史剧
发表于 2025-3-30 22:37:34
http://reply.papertrans.cn/39/3881/388035/388035_54.png
lethal
发表于 2025-3-31 02:25:46
Split-Perfect Graphs: Characterizations and Algorithmic Use,en graphs, and (7,3)-graphs. Moreover, split-perfect graphs form a new subclass of brittle graphs containing the superbrittle graphs for which a new characterization is obtained leading to linear time recognition.
使混合
发表于 2025-3-31 06:32:04
http://reply.papertrans.cn/39/3881/388035/388035_56.png
陈腐的人
发表于 2025-3-31 11:17:32
Angelo Azzi,Zdenek Drahota,Sergio Papa on series-parallel graphs which, for arbitrary δ,ε > 0, produces a solution which exceeds the bounds on the budget and the flow cost by factors 1+δ and 1+ε, respectively, while the amount of flow is at least that of an optimum solution. The running time of the algorithm is polynomial in the input size and 1/(δε).
消耗
发表于 2025-3-31 16:38:55
Optimizing Cost Flows by Modifying Arc Costs and Capacities, on series-parallel graphs which, for arbitrary δ,ε > 0, produces a solution which exceeds the bounds on the budget and the flow cost by factors 1+δ and 1+ε, respectively, while the amount of flow is at least that of an optimum solution. The running time of the algorithm is polynomial in the input size and 1/(δε).
Atrium
发表于 2025-3-31 19:47:01
http://reply.papertrans.cn/39/3881/388035/388035_59.png