ED431 发表于 2025-3-21 17:03:26

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

fluoroscopy 发表于 2025-3-21 23:39:26

http://reply.papertrans.cn/24/2317/231659/231659_2.png

专横 发表于 2025-3-22 03:22:12

http://reply.papertrans.cn/24/2317/231659/231659_3.png

nutrients 发表于 2025-3-22 08:16:16

Approximation through Randomization, many problems arising in different areas: taking into account the scope of this book, however, we will limit ourselves to considering randomized approximation algorithms for N.-hard optimization problems.

打击 发表于 2025-3-22 12:38:57

http://reply.papertrans.cn/24/2317/231659/231659_5.png

compel 发表于 2025-3-22 15:08:52

http://reply.papertrans.cn/24/2317/231659/231659_6.png

compel 发表于 2025-3-22 19:49:49

http://reply.papertrans.cn/24/2317/231659/231659_7.png

持久 发表于 2025-3-22 21:13:36

Heuristic methods,gorithms with a guaranteed behaviour, where such a guarantee refers both to the quality of the returned solution (in terms of either worst case or expected performance ratio) and to the running time (polynomial either in the worst or in the average case).

decipher 发表于 2025-3-23 03:06:17

https://doi.org/10.1007/978-3-642-58412-1Approximation; Combinatorial Algorithms; Complexity; Computer; Partition; Scheduling; Variable; calculus; co

轻而薄 发表于 2025-3-23 09:33:58

http://reply.papertrans.cn/24/2317/231659/231659_10.png
页: [1] 2 3 4 5
查看完整版本: Titlebook: Complexity and Approximation; Combinatorial Optimi Giorgio Ausiello,Alberto Marchetti-Spaccamela,Vigg Textbook 1999 Springer-Verlag Berlin