For a given graph with weighted vertices, the goal of the minimum-weight dominating set problem is to compute a vertex subset of smallest weight such that each vertex of the graph...
We present a linear time algorithm for the minimum linear arrangement problem on proper interval graphs. The obtained ordering is a 4-approximation for general interval graphs. 1 ...
An instance of the generalized partial cover problem consists of a ground set U and a family of subsets S 2U . Each element e U is associated with a profit p(e), whereas each su...
Given a graph H = (V, F) with edge weights {w(e) : e F}, the weighted degree of a node v in H is {w(vu) : vu F}. We give bicriteria approximation algorithms for problems that see...
Abstract—In contrast to existing work on the connected coverage problem in wireless sensor networks which assumes omnidirectional sensors with disk-like sensing range, this paper...
Xiaofeng Han, Xiang Cao, Errol L. Lloyd, Chien-Chu...