We consider the problem of computing an approximate minimum cycle basis of an undirected non-negative edge-weighted graph G with m edges and n vertices; the extension to directed ...
Telikepalli Kavitha, Kurt Mehlhorn, Dimitrios Mich...
Consider a dark polygonal region in which intruders move freely, trying to avoid detection. A robot, which is equipped with a flashlight, moves along the polygon boundary to illum...
Abstract. In-network processing emerges as an approach to reduce energy consumption in Wireless Sensor Networks (WSN) by decreasing the overall transferred data volume. Parallel pr...
Energy-efficient real-time task scheduling has been actively explored in the past decade. Different from the past work, this paper considers schedulability conditions for stochas...
Abstract. We study online scheduling to minimize flow time plus energy usage in the dynamic speed scaling model. We devise new speed scaling functions that depend on the number of ...
Tak Wah Lam, Lap-Kei Lee, Isaac Kar-Keung To, Prud...