Titlebook: Approximation and Online Algorithms; 6th International Wo Evripidis Bampis,Martin Skutella Conference proceedings 2009 Springer-Verlag Berl

显示全部楼层 · 发表于 2025-3-21 17:48:37

书目名称Approximation and Online Algorithms影响因子(影响力)

书目名称Approximation and Online Algorithms影响因子(影响力)学科排名

书目名称Approximation and Online Algorithms网络公开度

书目名称Approximation and Online Algorithms网络公开度学科排名

书目名称Approximation and Online Algorithms被引频次

书目名称Approximation and Online Algorithms被引频次学科排名

书目名称Approximation and Online Algorithms年度引用

书目名称Approximation and Online Algorithms年度引用学科排名

书目名称Approximation and Online Algorithms读者反馈

书目名称Approximation and Online Algorithms读者反馈学科排名

显示全部楼层 · 发表于 2025-3-21 23:39:47

显示全部楼层 · 发表于 2025-3-22 02:06:26

显示全部楼层 · 发表于 2025-3-22 07:23:20

显示全部楼层 · 发表于 2025-3-22 12:41:20

显示全部楼层 · 发表于 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.

显示全部楼层 · 发表于 2025-3-22 18:01:28

显示全部楼层 · 发表于 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

显示全部楼层 · 发表于 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 [6], we give an (.log.)-approximation algorithm for the resulting problem, where . is the maximum connectivity requirement, and .= 2.54.

		自动登录	找回密码
密码			To register

关于派博传思			派博传思旗下网站			友情链接
派博传思介绍	公司地理位置	论文服务流程	影响因子官网	SITEMAP	大讲堂	北京大学	Oxford Uni.	Harvard Uni.
发展历史沿革	期刊点评	投稿经验总结	SCIENCEGARD	IMPACTFACTOR	派博系数	清华大学	Yale Uni.	Stanford Uni.
\|Archiver\|手机版\|小黑屋\| 派博传思国际 ( 京公网安备110108008328) GMT+8, 2025-5-20 09:37
Copyright © 2001-2015 派博传思京公网安备110108008328 版权所有 All rights reserved

Titlebook: Approximation and Online Algorithms; 6th International Wo Evripidis Bampis,Martin Skutella Conference proceedings 2009 Springer-Verlag Berl

浏览过的版块