CSpace
(本次检索基于用户作品认领结果)

浏览/检索结果: 共13条,第1-10条 帮助

限定条件        
已选(0)清除 条数/页:   排序方式:
Algorithms for the metric ring star problem with fixed edge-cost ratio 期刊论文
JOURNAL OF COMBINATORIAL OPTIMIZATION, 2021, 卷号: 42, 期号: 3, 页码: 499-523
作者:  Chen, Xujin;  Hu, Xiaodong;  Jia, Xiaohua;  Tang, Zhongzheng;  Wang, Chenhao;  Zhang, Ying
收藏  |  浏览/下载:130/0  |  提交时间:2022/04/02
Ring star  Approximation algorithms  Heuristics  Local search  Connected facility location  
Risk Models for the Prize Collecting Steiner Tree Problems with Interval Data 期刊论文
ACTA MATHEMATICAE APPLICATAE SINICA-ENGLISH SERIES, 2014, 卷号: 30, 期号: 1, 页码: 1-26
作者:  AlvarezMiranda Eduardo;  CandiaVejar Alfredo;  Chen Xujin;  Hu Xiaodong;  Li Bi
收藏  |  浏览/下载:102/0  |  提交时间:2021/01/14
SERIES-PARALLEL GRAPHS  SHORTEST-PATH PROBLEM  COMPUTATIONAL-COMPLEXITY  NETWORK  OPTIMIZATION  CONSTRAINTS  ALGORITHMS  FLOWS  uncertainty modeling  prize collecting Steiner tree  interval data  series-parallel graphs  polynomial-time solvability  
On minimum m-connected k-dominating set problem in unit disc graphs 期刊论文
JOURNAL OF COMBINATORIAL OPTIMIZATION, 2008, 卷号: 16, 期号: 2, 页码: 99-106
作者:  Shang, Weiping;  Yao, Frances;  Wan, Pengjun;  Hu, Xiaodong
收藏  |  浏览/下载:156/0  |  提交时间:2018/07/30
k-dominating set  m-connectivity  unit disc graph  approximation algorithm  wireless sensor networks  
A full-scale solution to the rectilinear obstacle-avoiding Steiner problem 期刊论文
INTEGRATION-THE VLSI JOURNAL, 2008, 卷号: 41, 期号: 3, 页码: 413-425
作者:  Jing, Tom Tong;  Hu, Yu;  Feng, Zhe;  Hong, Xian-Long;  Hu, Xiaodong;  Yan, Guiying
收藏  |  浏览/下载:127/0  |  提交时间:2018/07/30
routing  rectilinear Steiner minimal tree  obstacle avoiding  ant colony optimization  track graph  hypergraph  full Steiner tree  detour  
lambda-OAT: lambda-geometry obstacle-avoiding tree construction with o (n log n) complexity 期刊论文
IEEE TRANSACTIONS ON COMPUTER-AIDED DESIGN OF INTEGRATED CIRCUITS AND SYSTEMS, 2007, 卷号: 26, 期号: 11, 页码: 2073-2079
作者:  Jing, Tom Tong;  Feng, Zhe;  Hu, Yu;  Hong, Xianlong L.;  Hu, Xiaodong D.;  Yan, Guiying Y.
收藏  |  浏览/下载:131/0  |  提交时间:2018/07/30
Index Terms-Physical design  routing  Steiner tree  very large scale  integration (VLSI).  
Algorithms for minimum m-connected k-tuple dominating set problem 期刊论文
THEORETICAL COMPUTER SCIENCE, 2007, 卷号: 381, 期号: 1-3, 页码: 241-247
作者:  Shang, Weiping;  Wan, Pengjun;  Yao, Frances;  Hu, Xiaodong
收藏  |  浏览/下载:127/0  |  提交时间:2018/07/30
connected dominating set  approximation algorithm  k-vertex connectivity  wireless sensor networks  
Inapproximability and approximability of maximal tree routing and coloring 期刊论文
JOURNAL OF COMBINATORIAL OPTIMIZATION, 2006, 卷号: 11, 期号: 2, 页码: 219-229
作者:  Chen, XJ;  Hu, XD;  Shuai, T
收藏  |  浏览/下载:121/0  |  提交时间:2018/07/30
multicast routing  coloring  maximum independent set  
Connected set cover problem and its applications 期刊论文
ALGORITHMIC ASPECTS IN INFORMATION AND MANAGEMENT, PROCEEDINGS, 2006, 卷号: 4041, 页码: 243-254
作者:  Shuai, Tian-Ping;  Hu, Xiao-Dong
收藏  |  浏览/下载:96/0  |  提交时间:2018/07/30
set cover  approximation algorithm  performance ratio  wavelength assignment  
Routing and coloring for maximal number of trees 期刊论文
COMPUTING AND COMBINATORICS, PROCEEDINGS, 2005, 卷号: 3595, 页码: 199-209
作者:  Chen, XJ;  Hu, XD;  Shuai, TP
收藏  |  浏览/下载:119/0  |  提交时间:2018/07/30
Complexity of minimal tree routing and coloring 期刊论文
ALGORITHMIC APPLICATIONS IN MANAGEMENT, PROCEEDINGS, 2005, 卷号: 3521, 页码: 6-15
作者:  Chen, XJ;  Hu, XD;  Jia, XH
收藏  |  浏览/下载:114/0  |  提交时间:2018/07/30