7 citations · 18 across the 6 of their papers we have counts for
6 papers
Multiple Constrained Routing Algorithms in Large-Scaled Software Defined Networks
Chenyang Xu, Liangde Tao, Huajingling Wu +2
In this paper, we consider the bandwidth-delay-hop constrained routing problem in large-scaled software defined networks. A number of demands, each of which specifies a source vert…
A Truthful FPTAS Mechanism for Emergency Demand Response in Colocation Data Centers
Jianhai Chen, Deshi Ye, Shouling Ji +3
Demand response (DR) is not only a crucial solution to the demand side management but also a vital means of electricity market in maintaining power grid reliability, sustainability…
A note on scheduling with low rank processing times
Lin Chen, Deshi Ye, Guochuan Zhang
We consider the classical minimum makespan scheduling problem, where the processing time of job on machine is , and the matrix is of a low…
Approximating the optimal competitive ratio for an ancient online scheduling problem
Lin Chen, Deshi Ye, Guochuan Zhang
We consider the classical online scheduling problem P||C_{max} in which jobs are released over list and provide a nearly optimal online algorithm. More precisely, an online algorit…
Strip Packing vs. Bin Packing
Xin Han, Kazuo Iwama, Deshi Ye +1
In this paper we establish a general algorithmic framework between bin packing and strip packing, with which we achieve the same asymptotic bounds by applying bin packing algorithm…
Improved online hypercube packing
Xin Han, Deshi Ye, Yong Zhou
In this paper, we study online multidimensional bin packing problem when all items are hypercubes. Based on the techniques in one dimensional bin packing algorithm Super Harmonic b…