找回密码
 To register

QQ登录

只需一步,快速开始

扫一扫,访问微社区

Titlebook: Algorithms - ESA 2007; 15th Annual European Lars Arge,Michael Hoffmann,Emo Welzl Conference proceedings 2007 Springer-Verlag Berlin Heidelb

[复制链接]
楼主: magnify
发表于 2025-3-23 12:19:00 | 显示全部楼层
发表于 2025-3-23 14:00:39 | 显示全部楼层
发表于 2025-3-23 20:35:33 | 显示全部楼层
Polynomial Time Algorithms for Minimum Energy Schedulinge. One common method for saving energy is to simply suspend the system during the idle times. No energy is consumed in the suspend mode. However, the process of waking up the system itself requires a certain fixed amount of energy, and thus suspending the system is beneficial only if the idle time i
发表于 2025-3-24 01:30:07 | 显示全部楼层
发表于 2025-3-24 04:07:22 | 显示全部楼层
Finding Branch-Decompositions and Rank-Decompositions an input matroid represented over a fixed finite field, outputs its branch-decomposition of width at most . if such exists. This algorithm works also for partitioned matroids. Both these algorithms are fixed-parameter tractable, that is, they run in time .(..) for each fixed value of . where . is t
发表于 2025-3-24 08:04:58 | 显示全部楼层
Fast Algorithms for Maximum Subset Matching and All-Pairs Shortest Paths in Graphs with a (Not So) Sr of vertices of . that can be matched in a matching of .. Our first result is a new randomized algorithm for the Maximum Subset Matching problem that improves upon the fastest known algorithms for this problem. Our algorithm runs in . time if . ≥ .. and in . time if . ≤ .., where .< 2.376 is the ma
发表于 2025-3-24 13:35:36 | 显示全部楼层
Radix Sorting with No Extra Spacerange [1,.] can be sorted in . time [5]. However, these algorithms use .(.) words of extra memory. Is this necessary?.We present a simple, stable, integer sorting algorithm for words of size .(log.), which works in .(.) time and uses only .(1) words of extra memory on a RAM model. This is the intege
发表于 2025-3-24 16:53:49 | 显示全部楼层
发表于 2025-3-24 21:32:40 | 显示全部楼层
978-3-540-75519-7Springer-Verlag Berlin Heidelberg 2007
发表于 2025-3-25 02:28:34 | 显示全部楼层
https://doi.org/10.1007/978-3-642-76317-5or small enough (additive) . — and hence, presumably, an intractable problem. This solved a long-standing open problem in Algorithmic Game Theory, but created many open questions. For example, it is known that inverse polynomial . is enough to make the problem intractable, while, for two player game
 关于派博传思  派博传思旗下网站  友情链接
派博传思介绍 公司地理位置 论文服务流程 影响因子官网 SITEMAP 大讲堂 北京大学 Oxford Uni. Harvard Uni.
发展历史沿革 期刊点评 投稿经验总结 SCIENCEGARD IMPACTFACTOR 派博系数 清华大学 Yale Uni. Stanford Uni.
|Archiver|手机版|小黑屋| 派博传思国际 ( 京公网安备110108008328) GMT+8, 2025-5-18 23:53
Copyright © 2001-2015 派博传思   京公网安备110108008328 版权所有 All rights reserved
快速回复 返回顶部 返回列表