We consider the problem of scheduling a set of n jobs on m identical parallel machines so as to minimize the weighted sum of job completion times. This problem is NP-hard in the s...
The cluster connecting problem inside a simple polygon is introduced in this paper. The problem is shown to be NP-complete. A log n-factor approximation algorithm is proposed.
Sanjib Sadhu, Arijit Bishnu, Subhas C. Nandy, Part...
We give a (1 - 1/e)-approximation algorithm for the Max-Profit Generalized Assignment Problem (Max-GAP) with fixed profits when the profit (but not necessarily the size) of every ...
We provide the first hardness result for the Covering Radius Problem on lattices (CRP). Namely, we show that for any large enough p there exists a constant cp > 1 such that C...
We give a short proof of a result of Tovey [6] on the inapproximability of a scheduling problem known as precedence constrained class sequencing. In addition, we present an approxi...