Chinese | English

Search in the results

CSpace

Browse/Search Results:  1-10 of 12 Help

Selected(0)Clear Items/Page:    Sort:
Parameterized Dynamic Cluster Editing 期刊论文
ALGORITHMICA, 2020, 页码: 44
Authors:  Luo, Junjie;  Molter, Hendrik;  Nichterlein, Andre;  Niedermeier, Rolf
Favorite  |  View/Download：99/0  |  Submit date：2020/09/23
Graph-based data clustering  Incremental clustering  Compromise clustering  Correlation clustering  Local search  Goal-oriented clustering  NP-hard problems  Fixed-parameter tractability  Parameterized complexity  Kernelization  Multi-choice knapsack  
Network Slicing for Service-Oriented Networks Under Resource Constraints 期刊论文
IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, 2017, 卷号: 35, 期号: 11, 页码: 2512-2521
Authors:  Zhang, Nan;  Liu, Ya-Feng;  Farmanbar, Hamid;  Chang, Tsung-Hui;  Hong, Mingyi;  Luo, Zhi-Quan
Favorite  |  View/Download：71/0  |  Submit date：2018/07/30
Software defined network  network function virtualization  traffic engineering  
Approximation algorithms for pricing with negative network externalities 期刊论文
JOURNAL OF COMBINATORIAL OPTIMIZATION, 2017, 卷号: 33, 期号: 2, 页码: 681-712
Authors:  Cao, Zhigang;  Chen, Xujin;  Hu, Xiaodong;  Wang, Changjun
Favorite  |  View/Download：118/0  |  Submit date：2018/07/30
Pricing  Approximation algorithms  NP-hardness  Social networks  Random networks  Negative externalities  
Dynamic Spectrum Management: A Complete Complexity Characterization 期刊论文
IEEE TRANSACTIONS ON INFORMATION THEORY, 2017, 卷号: 63, 期号: 1, 页码: 392-403
Authors:  Liu, Ya-Feng
Favorite  |  View/Download：60/0  |  Submit date：2018/07/30
Complexity theory  multi-carrier communication system  spectrum management  strong NP-hardness  
Shortest path and maximum flow problems in networks with additive losses and gains 期刊论文
THEORETICAL COMPUTER SCIENCE, 2011, 卷号: 412, 期号: 4-5, 页码: 391-401
Authors:  Brandenburg, Franz J.;  Cai, Mao-cheng
Favorite  |  View/Download：75/0  |  Submit date：2018/07/30
Extended networks  Lossy and gainy arcs  Max-flow problems  Shortest path problems  NP-hard problems  Unit-loss networks  
SCHEDULING WITH DISCRETELY COMPRESSIBLE RELEASE DATES TO MINIMIZE MAKESPAN 期刊论文
ASIA-PACIFIC JOURNAL OF OPERATIONAL RESEARCH, 2010, 卷号: 27, 期号: 4, 页码: 493-501
Authors:  Zhang, Shu-Xia;  Cao, Zhi-Gang;  Zhang, Yu-Zhong
Favorite  |  View/Download：69/0  |  Submit date：2018/07/30
Scheduling  discretely compressible release dates  approximation algorithm  makespan  
Scheduling with rejection and non-identical job arrivals 期刊论文
JOURNAL OF SYSTEMS SCIENCE & COMPLEXITY, 2007, 卷号: 20, 期号: 4, 页码: 529-535
Authors:  Cao, Zhigang;  Zhang, Yuzhong
Favorite  |  View/Download：58/0  |  Submit date：2018/07/30
non-identical job arrival  on-line  rejection  scheduling  
schedulingwithrejectionandnonidenticaljobarrivals 期刊论文
journalofsystemsscienceandcomplexity, 2007, 卷号: 020, 期号: 004, 页码: 529
Authors:  Zhigang Cao;  Yuzhong Zhang
Favorite  |  View/Download：56/0  |  Submit date：2020/01/10
Haplotype reconstruction from SNP fragments by minimum error correction 期刊论文
BIOINFORMATICS, 2005, 卷号: 21, 期号: 10, 页码: 2456-2462
Authors:  Wang, RS;  Wu, LY;  Li, ZP;  Zhang, XS
Favorite  |  View/Download：94/0  |  Submit date：2018/07/30
A simple factor-3 approximation for labeling points with circles 期刊论文
INFORMATION PROCESSING LETTERS, 2003, 卷号: 87, 期号: 2, 页码: 101-105
Authors:  Jiang, MH;  Qian, JB;  Qin, ZP;  Zhu, BH;  Cimikowski, R
Favorite  |  View/Download：70/0  |  Submit date：2018/07/30
approximation algorithms  circle packing  map labeling  NP-hardness