inhumane
发表于 2025-3-25 06:31:02
http://reply.papertrans.cn/16/1533/153289/153289_21.png
代理人
发表于 2025-3-25 09:52:10
http://reply.papertrans.cn/16/1533/153289/153289_22.png
一加就喷出
发表于 2025-3-25 14:29:09
https://doi.org/10.1007/978-3-662-42571-8We present two polynomial-time approximation algorithms for the metric case of the maximum traveling salesman problem. One of them is for directed graphs and its approximation ratio is .. The other is for undirected graphs and its approximation ratio is .. Both algorithms improve on the previous bests.
engender
发表于 2025-3-25 16:46:52
http://reply.papertrans.cn/16/1533/153289/153289_24.png
冥想后
发表于 2025-3-25 20:11:41
Algorithms – ESA 2005978-3-540-31951-1Series ISSN 0302-9743 Series E-ISSN 1611-3349
Dungeon
发表于 2025-3-26 00:56:08
0302-9743 Overview: 978-3-540-29118-3978-3-540-31951-1Series ISSN 0302-9743 Series E-ISSN 1611-3349
Pepsin
发表于 2025-3-26 06:46:55
http://reply.papertrans.cn/16/1533/153289/153289_27.png
招惹
发表于 2025-3-26 10:23:41
https://doi.org/10.1007/978-3-663-01365-5ncy, correctness, completeness, clarity of the design, modularity, flexibility, and ease of use. We present the generic design and structure of the libraries, which currently compute arrangements of curves and curve segments of low algebraic degree, and boolean operations on polygons bounded by such segments.
学术讨论会
发表于 2025-3-26 15:40:46
http://reply.papertrans.cn/16/1533/153289/153289_29.png
Maximize
发表于 2025-3-26 20:22:17
http://reply.papertrans.cn/16/1533/153289/153289_30.png