Halcyon 发表于 2025-3-21 18:43:02

书目名称Algorithms and Data Structures影响因子(影响力)<br>        http://figure.impactfactor.cn/if/?ISSN=BK0153152<br><br>        <br><br>书目名称Algorithms and Data Structures影响因子(影响力)学科排名<br>        http://figure.impactfactor.cn/ifr/?ISSN=BK0153152<br><br>        <br><br>书目名称Algorithms and Data Structures网络公开度<br>        http://figure.impactfactor.cn/at/?ISSN=BK0153152<br><br>        <br><br>书目名称Algorithms and Data Structures网络公开度学科排名<br>        http://figure.impactfactor.cn/atr/?ISSN=BK0153152<br><br>        <br><br>书目名称Algorithms and Data Structures被引频次<br>        http://figure.impactfactor.cn/tc/?ISSN=BK0153152<br><br>        <br><br>书目名称Algorithms and Data Structures被引频次学科排名<br>        http://figure.impactfactor.cn/tcr/?ISSN=BK0153152<br><br>        <br><br>书目名称Algorithms and Data Structures年度引用<br>        http://figure.impactfactor.cn/ii/?ISSN=BK0153152<br><br>        <br><br>书目名称Algorithms and Data Structures年度引用学科排名<br>        http://figure.impactfactor.cn/iir/?ISSN=BK0153152<br><br>        <br><br>书目名称Algorithms and Data Structures读者反馈<br>        http://figure.impactfactor.cn/5y/?ISSN=BK0153152<br><br>        <br><br>书目名称Algorithms and Data Structures读者反馈学科排名<br>        http://figure.impactfactor.cn/5yr/?ISSN=BK0153152<br><br>        <br><br>

ASSAY 发表于 2025-3-21 21:57:52

http://reply.papertrans.cn/16/1532/153152/153152_2.png

comely 发表于 2025-3-22 01:59:14

http://reply.papertrans.cn/16/1532/153152/153152_3.png

evaculate 发表于 2025-3-22 05:54:14

http://reply.papertrans.cn/16/1532/153152/153152_4.png

帐单 发表于 2025-3-22 11:14:42

1.25-Approximation Algorithm for Steiner Tree Problem with Distances 1 and 2,gated for long time since it is MAX SNP-hard and admits better approximations than the general problem. We give a 1.25 approximation algorithm for the Steiner Tree Problem with distances 1 and 2, improving on the previously best known ratio of 1.279.

障碍物 发表于 2025-3-22 14:52:58

Shortest Path Problems on a Polyhedral Surface,ll shortest path edge sequences and the diameter of a convex polyhedral surface. This speedup is achieved with kinetic Voronoi diagrams. We also use the star unfolding to compute a shortest path map and the Fréchet distance of a non-convex polyhedral surface.

渐变 发表于 2025-3-22 20:42:11

http://reply.papertrans.cn/16/1532/153152/153152_7.png

镶嵌细工 发表于 2025-3-23 00:32:41

http://reply.papertrans.cn/16/1532/153152/153152_8.png

慢慢冲刷 发表于 2025-3-23 03:08:58

http://reply.papertrans.cn/16/1532/153152/153152_9.png

Leisureliness 发表于 2025-3-23 08:50:25

http://reply.papertrans.cn/16/1532/153152/153152_10.png
页: [1] 2 3 4 5 6 7
查看完整版本: Titlebook: Algorithms and Data Structures; 11th International S Frank Dehne,Marina Gavrilova,Csaba D. Tóth Conference proceedings 2009 Springer-Verla