SCOWL
发表于 2025-3-21 17:21:26
书目名称Algorithmsand Complexity影响因子(影响力)<br> http://figure.impactfactor.cn/if/?ISSN=BK0153110<br><br> <br><br>书目名称Algorithmsand Complexity影响因子(影响力)学科排名<br> http://figure.impactfactor.cn/ifr/?ISSN=BK0153110<br><br> <br><br>书目名称Algorithmsand Complexity网络公开度<br> http://figure.impactfactor.cn/at/?ISSN=BK0153110<br><br> <br><br>书目名称Algorithmsand Complexity网络公开度学科排名<br> http://figure.impactfactor.cn/atr/?ISSN=BK0153110<br><br> <br><br>书目名称Algorithmsand Complexity被引频次<br> http://figure.impactfactor.cn/tc/?ISSN=BK0153110<br><br> <br><br>书目名称Algorithmsand Complexity被引频次学科排名<br> http://figure.impactfactor.cn/tcr/?ISSN=BK0153110<br><br> <br><br>书目名称Algorithmsand Complexity年度引用<br> http://figure.impactfactor.cn/ii/?ISSN=BK0153110<br><br> <br><br>书目名称Algorithmsand Complexity年度引用学科排名<br> http://figure.impactfactor.cn/iir/?ISSN=BK0153110<br><br> <br><br>书目名称Algorithmsand Complexity读者反馈<br> http://figure.impactfactor.cn/5y/?ISSN=BK0153110<br><br> <br><br>书目名称Algorithmsand Complexity读者反馈学科排名<br> http://figure.impactfactor.cn/5yr/?ISSN=BK0153110<br><br> <br><br>
原始
发表于 2025-3-21 21:44:18
Distributed Distance-, Covering Problems on Sparse High-Girth Graphsems admit constant factor approximations in the CONGEST model of distributed computing in a . number of rounds on classes of sparse high-girth graphs. In this paper, sparse means bounded expansion, and high-girth means girth at least .. Our algorithm is quite simple; however, the proof of its approx
Vertebra
发表于 2025-3-22 02:20:29
http://reply.papertrans.cn/16/1532/153110/153110_3.png
清澈
发表于 2025-3-22 07:29:49
http://reply.papertrans.cn/16/1532/153110/153110_4.png
悲痛
发表于 2025-3-22 12:06:47
http://reply.papertrans.cn/16/1532/153110/153110_5.png
Ventilator
发表于 2025-3-22 16:39:00
http://reply.papertrans.cn/16/1532/153110/153110_6.png
太空
发表于 2025-3-22 18:27:40
Upper Tail Analysis of Bucket Sort and Random TriesThe analysis holds even when a quadratic time algorithm is used to sort the keys in each bucket. We show how to obtain linear time guarantees on the running time of Bucket Sort that hold with .. Specifically, we investigate the asymptotic behavior of the exponent in the upper tail probability of the
Recess
发表于 2025-3-22 23:15:45
Throughput Scheduling with Equal Additive Laxity time ., a deadline ., and possibly a weight. The jobs have to be scheduled non-preemptively on . identical parallel machines. The goal is to find a schedule for a subset of jobs of maximum cardinality (or maximum total weight) that start and finish within their feasible time window .. In our specia
Brain-Waves
发表于 2025-3-23 03:17:16
http://reply.papertrans.cn/16/1532/153110/153110_9.png
大沟
发表于 2025-3-23 07:43:53
FPT and Kernelization Algorithms for the Induced Tree Problemresented the first polynomial time algorithm for this problem, which has become a critical subroutine in many algorithms for detecting induced subgraphs, such as beetles, pyramids, thetas, and even and odd-holes. In 2007, Derhy and Picouleau considered the natura