sulfonylureas 发表于 2025-3-21 19:59:03

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

谷物 发表于 2025-3-21 21:06:41

http://reply.papertrans.cn/23/2300/229964/229964_2.png

grieve 发表于 2025-3-22 02:17:04

http://reply.papertrans.cn/23/2300/229964/229964_3.png

Credence 发表于 2025-3-22 08:16:14

http://reply.papertrans.cn/23/2300/229964/229964_4.png

custody 发表于 2025-3-22 09:42:10

http://reply.papertrans.cn/23/2300/229964/229964_5.png

canvass 发表于 2025-3-22 14:17:59

http://reply.papertrans.cn/23/2300/229964/229964_6.png

canvass 发表于 2025-3-22 19:12:58

http://reply.papertrans.cn/23/2300/229964/229964_7.png

数量 发表于 2025-3-23 00:37:12

G. A. Persoon,H. Heuveling van Beekmotivated by applications in social network analysis. In this paper we investigate how the complexity of the problem depends on graph parameters (distance from disjoint paths and size of vertex cover), and that is not FPT-approximable. Moreover, we introduce a new variant of the problem, called ., w

同步信息 发表于 2025-3-23 03:04:33

http://reply.papertrans.cn/23/2300/229964/229964_9.png

pacific 发表于 2025-3-23 07:59:05

http://reply.papertrans.cn/23/2300/229964/229964_10.png
页: [1] 2 3 4 5 6 7
查看完整版本: Titlebook: Combinatorial Optimization and Applications; 10th International C T-H. Hubert Chan,Minming Li,Lusheng Wang Conference proceedings 2016 Spri