找回密码
 To register

QQ登录

只需一步,快速开始

扫一扫,访问微社区

Titlebook: Approximation and Online Algorithms; 16th International W Leah Epstein,Thomas Erlebach Conference proceedings 2018 Springer Nature Switzerl

[复制链接]
楼主: 烈酒
发表于 2025-3-30 08:22:48 | 显示全部楼层
Schriftleitung der „Naturwissenschaften“rsion gives an .-approximation. We argue that this can be interpreted as a generalization of an analogous result by Könemann et al. (Algorithmica ’11) for partial cover problems. Together with a lower bound construction by Mestre (STACS’08) for partial cover this implies that our bound is essentiall
发表于 2025-3-30 16:21:13 | 显示全部楼层
发表于 2025-3-30 17:22:09 | 显示全部楼层
Ergebnisse der Exakten Naturwissenschaftenm..Our results show that, without additional information, the central authority cannot perform satisfactorily well, and we establish a lower bound linear in |.| for the number of advice bits needed for near-optimal solutions, where |.| denotes the number of edges in the grid. Furthermore, concerning
发表于 2025-3-31 00:06:05 | 显示全部楼层
发表于 2025-3-31 03:39:46 | 显示全部楼层
发表于 2025-3-31 06:24:34 | 显示全部楼层
Ergebnisse der Exakten Naturwissenschaftenase of the game where the weight of any item is the same as its size, and any item has size at most one half. The previous bound was about 1.46457. Next we give another setting where the PoA is at most .. This value is better than any previous, that was got for such games.
发表于 2025-3-31 10:20:06 | 显示全部楼层
发表于 2025-3-31 13:53:54 | 显示全部楼层
发表于 2025-3-31 20:34:46 | 显示全部楼层
发表于 2025-4-1 00:24:29 | 显示全部楼层
 关于派博传思  派博传思旗下网站  友情链接
派博传思介绍 公司地理位置 论文服务流程 影响因子官网 SITEMAP 大讲堂 北京大学 Oxford Uni. Harvard Uni.
发展历史沿革 期刊点评 投稿经验总结 SCIENCEGARD IMPACTFACTOR 派博系数 清华大学 Yale Uni. Stanford Uni.
|Archiver|手机版|小黑屋| 派博传思国际 ( 京公网安备110108008328) GMT+8, 2025-5-6 21:40
Copyright © 2001-2015 派博传思   京公网安备110108008328 版权所有 All rights reserved
快速回复 返回顶部 返回列表