We present a spectral approach to design approximation algorithms for network problems. observe that the underlying mathematical questions are rounding problems, which were studied in sparsification and discrepancy theory. extend these results incorporate additional non-negative linear constraints, show they can be used significantly scope of problems solved. Our algorithm is an iterative rando...