We show that the greedy Highest Density First (HDF) algorithm is (1+ )-speed O(1)-competitive for the problem of minimizing the p norms of weighted flow time on m identical machin...
We study simple greedy approximation algorithms for general class of integer packing problems. We provide a novel analysis based on the duality theory of linear programming. This e...
We demonstrate that the Linear Multidimensional Assignment Problem with iid random costs is polynomially "-approximable almost surely (a. s.) via a simple greedy heuristic, f...
We provide a new simpler approach to the on-line load balancing problem in the case of restricted assignment of temporary weighted tasks. The approach is very general and allows to...
Pierluigi Crescenzi, Giorgio Gambosi, Gaia Nicosia...
For an edge-weighted connected undirected graph, the minimum k-way cut problem is to find a subset of edges of minimum total weight whose removal separates the graph into k connect...