An approximation algorithm for interval data minmax regret combinatorial optimization problems
- 作者Adam Kasperski; Paweł Zieliński
- 卷第97卷
- 期第5期
- 印刷ISSN0020-0190
- 文件大小61.93KB
- 发表时间2006
- DOI10.1016/j.ipl.2005.11.001
- 页码177-180
New bounds for multi-label interval routingSavio S.H. Tse; Francis C.M. Lau · 2004
Online Bounds on Balancing Two Independent Criteria with Replication and ReallocationTse, Savio S.H. · IEEE Transactions on Computers · 2012
[IEEE 2016 IEEE Trustcom/BigDataSE/ISPA - Tianjin, China (2016.8.23-2016.8.26)] 2016 IEEE Trustcom/BigDataSE/ISPA - Bicriteria Load Balancing for Online Placement in Heterogeneous Servers with Extreme Upper BoundsTse, Savio S.H. · 2016
[IEEE 2014 IEEE 17th International Conference on Computational Science and Engineering (CSE) - Chengdu, China (2014.12.19-2014.12.21)] 2014 IEEE 17th International Conference on Computational Science and Engineering - Belated Analyses of Three Credit-Based Adaptive Polling AlgorithmsTse, Savio S.H. · 2014
[IEEE 2012 12th International Symposium on Pervasive Systems, Algorithms, and Networks (I-SPAN) - San Marcos, TX, USA (2012.12.13-2012.12.15)] 2012 12th International Symposium on Pervasive Systems, Algorithms and Networks - Rotating Escalators upon Deletions for Improving Online Bicriteria Load BalancingTse, Savio S.H. · 2012
[IEEE 2013 12th IEEE International Conference on Trust, Security and Privacy in Computing and Communications (TrustCom) - Melbourne, Australia (2013.07.16-2013.07.18)] 2013 12th IEEE International Conference on Trust, Security and Privacy in Computing and Communications - Bicriteria Load Balancing for Online Placement in Heterogeneous Servers with Pareto Upper BoundsTse, Savio S.H. · 2013