频率 发表于 2025-3-21 19:15:08

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

stress-response 发表于 2025-3-21 22:26:50

Voronoi Diagram in the Flow Fieldnstructed. The method is a modification of a so-called fast marching method originally proposed for the eikonal equation. Computational experiments show the efficiency and the stableness of the proposal method.

威胁你 发表于 2025-3-22 00:45:54

Finding the Maximum Common Subgraph of a Partial ,-Tree and a Graph with a Polynomially Bounded Numbn connected induced subgraph is generated in polynomial time since a subgraph of a partial .-tree is also a partial .-tree. Among all of these candidates, we can find the maximum common connected induced subgraph for .. and ...

dissent 发表于 2025-3-22 07:07:58

Polynomial Time 2-Approximation Algorithms for the Minmax Subtree Cover Problemhe subtrees covers all vertices in ., where the objective is to minimize the maximum weight of the subtrees. In this paper, we propose an .(...) time .-approximation algorithm to the first problem, and an . time (2+.)-approximation algorithm to the second problem, where .> 0 is a prescribed constant.

Ferritin 发表于 2025-3-22 12:28:57

http://reply.papertrans.cn/16/1532/153126/153126_5.png

GLUE 发表于 2025-3-22 14:39:25

Risikoberichterstattung im Lagebericht,n linear time. We also give an algorithm to approximate . with a function consisting of the minimum number of single-peaked pieces under the condition that each single-peaked piece is within a fixed .. distance from the corresponding portion of ..

gregarious 发表于 2025-3-22 17:13:06

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

FAZE 发表于 2025-3-22 22:09:44

https://doi.org/10.1007/978-3-540-85251-3omplexity of an entangled quantum state by determining (i) how hard to approximate it from a fixed classical state and (ii) how hard to distinguish it from all partially separable states. We further consider the Kolmogorovian-style descriptive complexity of approximation and distinction of partial entanglement.

神圣不可 发表于 2025-3-23 03:45:47

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

peak-flow 发表于 2025-3-23 07:56:56

http://reply.papertrans.cn/16/1532/153126/153126_10.png
页: [1] 2 3 4 5 6 7
查看完整版本: Titlebook: Algorithms and Computation; 14th International S Toshihide Ibaraki,Naoki Katoh,Hirotaka Ono Conference proceedings 2003 Springer-Verlag Ber