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

Search Results

Help

Item hits: (Results 1-7 of 7)

Filters    
Items/Page:    Sort:
approximating minimum label s-t cut via linear programming [会议论文]
10th Latin American Symposiumon Theoretical Informatics, LATIN 2012, Arequipa, Peru, April 16, 2012 - April 20, 2012
Tang Linqing; Zhang Peng

 
approximation and hardness results for label cut and related problems [会议论文]
6th Annual Conference on Theory and Applications of Models of Computation, TAMC 2009, Changsha, China, 43969
Zhang Peng; Cai Jin-Yi; Tang Linqing; Zhao Wenbo

 
an approximation algorithm to the k-steiner forest problem [会议论文]
4th International Conference on Theory and Applications of Models of Computation, Shanghai, PEOPLES R CHINA, MAY 22-25,
Zhang Peng
  |  
 
approximation to the minimum rooted star cover problem [会议论文]
4th International Conference on Theory and Applications of Models of Computation, Shanghai, PEOPLES R CHINA, MAY 22-25,
Zhao Wenbo; Zhang Peng
  |  
 
high performance approach for multi-qos constrained web services selection [会议论文]
5th International Conference on Service-Oriented Computing (ICSOC 2007), Vienna, AUSTRIA, SEP 17-20,
Li Lei; Wei Jun; Huang Tao
  |  
 
approximating generalized multicut on trees [会议论文]
3rd Conference on Computability in Europe (CiE 2007), Siena, ITALY, JUN 18-23,
Zhang Peng
  |  
 
an active measurement approach for link faults monitoring in isp networks [会议论文]
4th International Conference on Grid and Cooperative Computing - GCC 2005, Beijing, China, 40850
Li Wenwei; Zhang Dafang; Yang Jinmin; Xie Gaogang
  |  
 

1

 

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