Esalate
发表于 2025-4-1 05:08:13
http://reply.papertrans.cn/17/1605/160455/160455_61.png
instulate
发表于 2025-4-1 08:52:27
Inapproximability of Survivable Networkse derive some new hardness of approximation results, as follows. We show that directed and undirected variants of . and of .. are equivalent w.r.t. approximation, and that a .-approximation for . implies a .-approximation for ..
arbovirus
发表于 2025-4-1 12:38:03
Trennungsenergien einzelner Bindungen,ts are shown to be tight. Finally, we introduce the . for the vertex cover problem, defined as the worst-case ratio between the sizes of a minimum connected vertex cover and a minimum vertex cover. We prove that the price of connectivity is bounded by 2/(1 + .) in graphs with average degree ., and give a family of near-tight examples.
建筑师
发表于 2025-4-1 16:16:09
Die Schlierenverfahren und ihre Anwendungen,gorithm. Here we present a ratio 4/. ≈ 1.27 approximation algorithm in the length measure, which performs at most four sweeps. We also prove that, for the two constrained variants, there are sets of . points for which any sequence of minimum cost requires 3./2 − .(1) sweeps.
精致
发表于 2025-4-1 21:16:52
http://reply.papertrans.cn/17/1605/160455/160455_65.png