4 citations · 7 across the 7 of their papers we have counts for
8 papers
Online Knapsack Problems with a Resource Buffer
Xin Han, Yasushi Kawase, Kazuhisa Makino +1
In this paper, we introduce online knapsack problems with a resource buffer. In the problems, we are given a knapsack with capacity , a buffer with capacity , and items…
An Improved Speedup Factor for Sporadic Tasks with Constrained Deadlines under Dynamic Priority Scheduling
Xin Han, Liang Zhao, Zhishan Guo +1
Schedulability is a fundamental problem in real-time scheduling, but it has to be approximated due to the intrinsic computational hardness. As the most popular algorithm for decidi…
Deterministic Online Call Control in Cellular Networks and Triangle-Free Cellular Networks
Joseph Wun-Tat Chan, Francis Y. L. Chin, Xin Han +3
Wireless Communication Networks based on Frequency Division Multiplexing (FDM in short) plays an important role in the field of communications, in which each request can be satisfi…
A New Upper Bound on 2D Online Bin Packing
Xin Han, Francis Y. L. Chin, Hing-Fung Ting +1
The 2D Online Bin Packing is a fundamental problem in Computer Science and the determination of its asymptotic competitive ratio has attracted great research attention. In a long s…
On Two Dimensional Orthogonal Knapsack Problem
Xin Han, Kazuo Iwama, Guochuan Zhang
In this paper, we study the following knapsack problem: Given a list of squares with profits, we are requested to pack a sublist of them into a rectangular bin (not a unit square b…
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…