蒸发
发表于 2025-3-30 10:48:31
http://reply.papertrans.cn/17/1604/160384/160384_51.png
Graphite
发表于 2025-3-30 14:57:41
http://reply.papertrans.cn/17/1604/160384/160384_52.png
objection
发表于 2025-3-30 18:14:32
http://reply.papertrans.cn/17/1604/160384/160384_53.png
NUDGE
发表于 2025-3-30 23:38:37
https://doi.org/10.1007/978-3-8349-9978-8s to a sink and to install capacity on the edges to support flows at minimum cost. Capacity can be purchased only in multiples of a fixed quantity. All the flow from a source must be routed in a single path to the sink. This NP-hard problem generalizes the Steiner tree problem and also more effectiv
荧光
发表于 2025-3-31 01:30:27
https://doi.org/10.1007/978-3-663-07644-5give the first non-trivial approximation algorithm for this problem, having an approximation guarantee of 3·H., where . is the maximum requirement and H. is the k-th harmonic number. Our algorithm is along the lines of [.] for the generalized Steiner network problem. It runs in phases, and each phas
indicate
发表于 2025-3-31 06:29:27
Theoretische Herleitung der Hypothesendórsson and Hassin (Information Processing Letters 47:275-282, 1993) give approximation algorithms with ratio 3.55 (tree cover) and 5.5 (tour cover). We present algorithms with worst-case ratio 3 for both problems.
词根词缀法
发表于 2025-3-31 11:53:16
http://reply.papertrans.cn/17/1604/160384/160384_57.png
烦忧
发表于 2025-3-31 13:49:11
Improved Approximations for Tour and Tree Coversdórsson and Hassin (Information Processing Letters 47:275-282, 1993) give approximation algorithms with ratio 3.55 (tree cover) and 5.5 (tour cover). We present algorithms with worst-case ratio 3 for both problems.
FLEET
发表于 2025-3-31 18:52:52
http://reply.papertrans.cn/17/1604/160384/160384_59.png
聚集
发表于 2025-3-31 22:37:10
http://reply.papertrans.cn/17/1604/160384/160384_60.png