LANCE
发表于 2025-3-30 12:02:44
https://doi.org/10.1007/978-3-663-16160-8g that 2.-connected bipartite graphs are .-tight. We give a new algorithm for finding a maximal .-sharp subgraph. We also answer a question of Imai and show that finding a maximum size .-sharp subgraph is NP-hard.
手榴弹
发表于 2025-3-30 15:11:42
http://reply.papertrans.cn/16/1531/153050/153050_52.png
肉体
发表于 2025-3-30 18:07:05
http://reply.papertrans.cn/16/1531/153050/153050_53.png
忍受
发表于 2025-3-30 21:05:39
http://reply.papertrans.cn/16/1531/153050/153050_54.png
Adenocarcinoma
发表于 2025-3-31 02:50:12
Optimal Dynamic Video-on-Demand Using Adaptive Broadcastingnd propose strategies which are optimal for each of them. In particular, we show that an adaptive form of pyramid broadcasting is optimal for both measures simultaneously, up to constant factors. We also show that the maximum throughput for a fixed network bandwidth cannot be obtained by any online strategy.
chronology
发表于 2025-3-31 05:11:00
http://reply.papertrans.cn/16/1531/153050/153050_56.png
正常
发表于 2025-3-31 12:18:01
Entscheidung über den Einspruchraction of the input data is essentially unnecessary. While grounding the discussion on a few specific examples, I will review some of the basic principles at play behind this “sublinearity” phenomenon.
Antioxidant
发表于 2025-3-31 17:06:16
http://reply.papertrans.cn/16/1531/153050/153050_58.png
GUISE
发表于 2025-3-31 20:24:50
http://reply.papertrans.cn/16/1531/153050/153050_59.png
摇曳的微光
发表于 2025-4-1 00:56:56
An Optimal Algorithm for the Maximum-Density Segment Problemhe input sequence in an online manner, which is an important feature for dealing with genome-scale sequences. Moreover, for an input sequence . representable in .(.) space, we also show how to exploit the sparsity of . and solve the maximum-density segment problem for . in .(.) time.