PaperOn the hardness of approximating multicut and sparsest-cutShuchi Chawla, Robert Krauthgamer, et al.Computational Complexity
PaperOn polynomial-factor approximations to the shortest lattice vector lengthRavi Kumar, D. SivakumarSIAM Journal on Discrete Mathematics
PaperMinimizing wirelength in zero and bounded skew clock treesMoses Charikar, Jon Kleinberg, et al.SIAM Journal on Discrete Mathematics
