首页 | 官方网站   微博 | 高级检索  
     


On the complexity of approximating tsp with neighborhoods and related problems
Authors:Shmuel Safra  Oded Schwartz
Affiliation:(1) School of Computer Science, Tel-Aviv University, Tel-Aviv, 69978, Israel;(2) School of Computer Science, Tel-Aviv University, Tel-Aviv, 69978, Israel
Abstract:
Keywords:NP-optimization problems  approximation  hardness of approximation  inapproximability  TSP  TSP with neighborhoods
本文献已被 SpringerLink 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司    京ICP备09084417号-23

京公网安备 11010802026262号