TRACT
发表于 2025-3-21 17:48:37
书目名称Approximation and Online Algorithms影响因子(影响力)<br> http://figure.impactfactor.cn/if/?ISSN=BK0160417<br><br> <br><br>书目名称Approximation and Online Algorithms影响因子(影响力)学科排名<br> http://figure.impactfactor.cn/ifr/?ISSN=BK0160417<br><br> <br><br>书目名称Approximation and Online Algorithms网络公开度<br> http://figure.impactfactor.cn/at/?ISSN=BK0160417<br><br> <br><br>书目名称Approximation and Online Algorithms网络公开度学科排名<br> http://figure.impactfactor.cn/atr/?ISSN=BK0160417<br><br> <br><br>书目名称Approximation and Online Algorithms被引频次<br> http://figure.impactfactor.cn/tc/?ISSN=BK0160417<br><br> <br><br>书目名称Approximation and Online Algorithms被引频次学科排名<br> http://figure.impactfactor.cn/tcr/?ISSN=BK0160417<br><br> <br><br>书目名称Approximation and Online Algorithms年度引用<br> http://figure.impactfactor.cn/ii/?ISSN=BK0160417<br><br> <br><br>书目名称Approximation and Online Algorithms年度引用学科排名<br> http://figure.impactfactor.cn/iir/?ISSN=BK0160417<br><br> <br><br>书目名称Approximation and Online Algorithms读者反馈<br> http://figure.impactfactor.cn/5y/?ISSN=BK0160417<br><br> <br><br>书目名称Approximation and Online Algorithms读者反馈学科排名<br> http://figure.impactfactor.cn/5yr/?ISSN=BK0160417<br><br> <br><br>
JAUNT
发表于 2025-3-21 23:39:47
http://reply.papertrans.cn/17/1605/160417/160417_2.png
inspiration
发表于 2025-3-22 02:06:26
http://reply.papertrans.cn/17/1605/160417/160417_3.png
Ledger
发表于 2025-3-22 07:23:20
http://reply.papertrans.cn/17/1605/160417/160417_4.png
骇人
发表于 2025-3-22 12:41:20
http://reply.papertrans.cn/17/1605/160417/160417_5.png
交响乐
发表于 2025-3-22 13:57:13
Max-Weight Integral Multicommodity Flow in Spiders and High-Capacity Treesof instances for which exact solutions can be found efficiently. When the tree is a . (i.e. if only one vertex has degree greater than 2) we give a polynomial-time algorithm to find an optimal solution, as well as a polyhedral description of the convex hull of all integral feasible solutions.
Nerve-Block
发表于 2025-3-22 18:01:28
http://reply.papertrans.cn/17/1605/160417/160417_7.png
Pastry
发表于 2025-3-22 21:28:39
Stackelberg Strategies and Collusion in Network Games with Splittable Flow single atomic follower. Finally, we investigate SCALE for multiple coalitional followers, general networks, and affine linear latencies. We present the first known upper bound on the price of anarchy in this case. Our bound smoothly varies between 1.5 when .= 0 and full efficiency when .= 1.
装入胶囊
发表于 2025-3-23 04:08:46
Peak Shaving through Resource Bufferingty, with the goal of maximizing the amount by which the peak is reduced. We give efficient optimal algorithms for the offline problem, with and without a bounded battery. We also show how to find the optimal offline battery size, given the requirement that the final battery level equals the initial
muster
发表于 2025-3-23 06:16:36
Approximation Algorithms for Prize-Collecting Network Design Problems with General Connectivity Requfunctions in the same form as that of Sharma et al. Using ideas from Goemans and Berstimas , we give an (.log.)-approximation algorithm for the resulting problem, where . is the maximum connectivity requirement, and .= 2.54.