郊外
发表于 2025-4-1 04:19:26
http://reply.papertrans.cn/16/1531/153051/153051_61.png
IRK
发表于 2025-4-1 08:12:41
Tight Bounds and a Fast FPT Algorithm for Directed Max-Leaf Spanning Treeith minimum in-degree 3, ., where previously . was the best known bound. This bound is tight, and also holds for the larger class of digraphs with minimum in-degree 3 in which every arc is part of at least one out-branching.
含糊
发表于 2025-4-1 11:05:36
http://reply.papertrans.cn/16/1531/153051/153051_63.png
讥讽
发表于 2025-4-1 14:37:21
Der Enterprise Transformation Cycleudy of strongly connected cyclic level graphs. In particular, we present a linear time algorithm for the planarity testing and embedding problem, and we characterize forbidden subgraphs. Our results generalize earlier work on level graphs.
的阐明
发表于 2025-4-1 21:24:39
Constantin Brunner,Lothar Bickelhe worst-case number of tetrahedra cannot be bounded as a function of .. Finally, we obtain several results on the problem where we want to only cover the boundary of the polyhedron, and not its entire interior.
prediabetes
发表于 2025-4-2 02:25:50
http://reply.papertrans.cn/16/1531/153051/153051_66.png
门窗的侧柱
发表于 2025-4-2 06:54:40
A Near-Tight Bound for the Online Steiner Tree Problem in Graphs of Bounded Asymmetryh non-symmetric links. We show an improved upper bound of . on the competitive ratio of a simple greedy algorithm, for any request sequence of . terminals. The result almost matches the lower bound of . (where . is an arbitrarily small constant) due to Faloutsos . and Angelopoulos .
信任
发表于 2025-4-2 09:37:23
http://reply.papertrans.cn/16/1531/153051/153051_68.png
FAST
发表于 2025-4-2 14:45:57
Decompositions and Boundary Coverings of Non-convex Fat Polyhedrahe worst-case number of tetrahedra cannot be bounded as a function of .. Finally, we obtain several results on the problem where we want to only cover the boundary of the polyhedron, and not its entire interior.
档案
发表于 2025-4-2 17:18:52
A Constant-Approximate Feasibility Test for Multiprocessor Real-Time Scheduling. We also provide an improved bound trading off speed for additional machines..Our analysis relies on a new concept for counting the workload of an interval, that might also turn useful for analyzing other types of task systems.