We present e cient new randomized and deterministic methods for transforming optimal solutions for a type of relaxed integer linear program into provably good solutions for the corresponding NP-hard discrete optimization problem. Without any constraint violation, the -approximation problem for many problems of this type is itself NP-hard. Our methodsâ€¦Â (More)