1 citations · 1 across the 5 of their papers we have counts for
9 papers
Minimum Partition of Polygons under Width and Cut Constraints
Jaehoon Chung, Kazuo Iwama, Chung-Shou Liao +1
We study the problem of partitioning a polygon into the minimum number of subpolygons using cuts in predetermined directions such that each resulting subpolygon satisfies a given w…
Learning to Code on Graphs for Topological Interference Management
Zhiwei Shan, Xinping Yi, Han Yu +2
The state-of-the-art coding schemes for topological interference management (TIM) problems are usually handcrafted for specific families of network topologies, relying critically o…
Improving the Bounds of the Online Dynamic Power Management Problem
Ya-Chun Liang, Kazuo Iwama, Chung-Shou Liao
We investigate the {\em power-down mechanism} which decides when a machine transitions between states such that the total energy consumption, characterized by execution cost, idle…
Online TSP with Predictions
Hsiao-Yu Hu, Hao-Ting Wei, Meng-Hsi Li +2
We initiate the study of online routing problems with predictions, inspired by recent exciting results in the area of learning-augmented algorithms. A learning-augmented online alg…
Tight Competitive Analyses of Online Car-sharing Problems
Ya-Chun Liang, Kuan-Yun Lai, Ho-Lin Chen +1
The car-sharing problem, proposed by Luo, Erlebach and Xu in 2018, mainly focuses on an online model in which there are two locations: 0 and 1, and total cars. Each request whi…
Topological Interference Management with Adversarial Topology Perturbation: An Algorithmic Perspective
Ya-Chun Liang, Chung-Shou Liao, Xinping Yi
In this paper, we consider the topological interference management (TIM) problem in a dynamic setting, where an adversary perturbs network topology to prevent the exploitation of s…
Waiting is not easy but worth it: the online TSP on the line revisited
Pei-Chuan Chen, Erik D. Demaine, Chung-Shou Liao +1
We consider the online traveling salesman problem on the real line (OLTSPL) in which a salesman begins at the origin, traveling at no faster than unit speed along the real line, an…
Link Delay Estimation Using Sparse Recovery for Dynamic Network Tomography
Hao-Ting Wei, Sung-Hsien Hsieh, Wen-Liang Hwang +2
When the scale of communication networks has been growing rapidly in the past decades, it becomes a critical challenge to extract fast and accurate estimation of key state paramete…
An -Approximation Algorithm for Dynamic Weighted Vertex Cover with Soft Capacity
Hao-Ting Wei, Wing-Kai Hon, Paul Horn +2
This study considers the (soft) capacitated vertex cover problem in a dynamic setting. This problem generalizes the dynamic model of the vertex cover problem, which has been intens…