中国科学院软件研究所机构知识库
Advanced  
ISCAS OpenIR

Search Results

Help

Item hits: (Results 1-1 of 1)

Items/Page:    Sort:
on the complexity and approximation of the min-sum and min-max disjoint paths problems [会议论文]
1st International Conference on Combinatorics, Algorithms, Probabilistic and Experimental Methodologies, Hangzhou, PEOPLES R CHINA, APR 07-09,
Zhang Peng; Zhao Wenbo
  |  
 

1

 

Valid XHTML 1.0!
Copyright © 2007-2019  中国科学院软件研究所 - Feedback
Powered by CSpace