找回密码
 To register

QQ登录

只需一步,快速开始

扫一扫,访问微社区

Titlebook: WALCOM: Algorithms and Computation; 16th International C Petra Mutzel,Md. Saidur Rahman,Slamin Conference proceedings 2022 Springer Nature

[复制链接]
查看: 14027|回复: 74
发表于 2025-3-21 17:19:29 | 显示全部楼层 |阅读模式
书目名称WALCOM: Algorithms and Computation
副标题16th International C
编辑Petra Mutzel,Md. Saidur Rahman,Slamin
视频video
丛书名称Lecture Notes in Computer Science
图书封面Titlebook: WALCOM: Algorithms and Computation; 16th International C Petra Mutzel,Md. Saidur Rahman,Slamin Conference proceedings 2022 Springer Nature
描述This book constitutes the proceedings of the 16th International Conference on Algorithms and Computation, WALCOM 2022, which was held in Jember, Indonesia, during March 24-26, 2022..This proceedings volume contains 30 full papers which were carefully reviewed and selected from a total of 89 submissions and 3 invited papers. They cover diverse areas of algorithms and computation, such as approximation algorithms, computational complexity, computational geometry, graph algorithms, graph drawing and visualization, online algorithms, parameterized complexity and property testing..
出版日期Conference proceedings 2022
关键词Algorithms and Computation; approximation algorithms; Approximation Algorithms; approximation theory; Co
版次1
doihttps://doi.org/10.1007/978-3-030-96731-4
isbn_softcover978-3-030-96730-7
isbn_ebook978-3-030-96731-4Series ISSN 0302-9743 Series E-ISSN 1611-3349
issn_series 0302-9743
copyrightSpringer Nature Switzerland AG 2022
The information of publication is updating

书目名称WALCOM: Algorithms and Computation影响因子(影响力)




书目名称WALCOM: Algorithms and Computation影响因子(影响力)学科排名




书目名称WALCOM: Algorithms and Computation网络公开度




书目名称WALCOM: Algorithms and Computation网络公开度学科排名




书目名称WALCOM: Algorithms and Computation被引频次




书目名称WALCOM: Algorithms and Computation被引频次学科排名




书目名称WALCOM: Algorithms and Computation年度引用




书目名称WALCOM: Algorithms and Computation年度引用学科排名




书目名称WALCOM: Algorithms and Computation读者反馈




书目名称WALCOM: Algorithms and Computation读者反馈学科排名




单选投票, 共有 0 人参与投票
 

0票 0%

Perfect with Aesthetics

 

0票 0%

Better Implies Difficulty

 

0票 0%

Good and Satisfactory

 

0票 0%

Adverse Performance

 

0票 0%

Disdainful Garbage

您所在的用户组没有投票权限
发表于 2025-3-21 21:15:26 | 显示全部楼层
发表于 2025-3-22 03:55:31 | 显示全部楼层
发表于 2025-3-22 08:34:02 | 显示全部楼层
发表于 2025-3-22 10:59:56 | 显示全部楼层
发表于 2025-3-22 13:11:25 | 显示全部楼层
Reverse Shortest Path Problem in Weighted Unit-Disk Graphsthe shortest path length between . and . in . is at most .. In this paper, we study the weighted case and present an . time algorithm. We also consider the . version of the problem where the distance of two points is measured by the . metric; we solve the problem in . time for both the unweighted and weighted cases.
发表于 2025-3-22 20:49:08 | 显示全部楼层
0302-9743 , computational geometry, graph algorithms, graph drawing and visualization, online algorithms, parameterized complexity and property testing..978-3-030-96730-7978-3-030-96731-4Series ISSN 0302-9743 Series E-ISSN 1611-3349
发表于 2025-3-22 22:01:47 | 显示全部楼层
发表于 2025-3-23 05:16:26 | 显示全部楼层
发表于 2025-3-23 09:04:25 | 显示全部楼层
 关于派博传思  派博传思旗下网站  友情链接
派博传思介绍 公司地理位置 论文服务流程 影响因子官网 SITEMAP 大讲堂 北京大学 Oxford Uni. Harvard Uni.
发展历史沿革 期刊点评 投稿经验总结 SCIENCEGARD IMPACTFACTOR 派博系数 清华大学 Yale Uni. Stanford Uni.
|Archiver|手机版|小黑屋| 派博传思国际 ( 京公网安备110108008328) GMT+8, 2025-5-2 16:02
Copyright © 2001-2015 派博传思   京公网安备110108008328 版权所有 All rights reserved
快速回复 返回顶部 返回列表