Efficient dispersal of information for security, load balancing, and fault tolerance
Journal of the ACM (JACM)
Parallel graph algorithms that are efficient on average
SFCS '87 Proceedings of the 28th Annual Symposium on Foundations of Computer Science
Channel routing of multiterminal nets
SFCS '87 Proceedings of the 28th Annual Symposium on Foundations of Computer Science
Approximation algorithms for scheduling unrelated parallel machines
SFCS '87 Proceedings of the 28th Annual Symposium on Foundations of Computer Science
Hi-index | 0.00 |
We consider the problem of approximating an integer program by first solving its relaxation linear program and "rounding" the resulting solution. For several packing problems, we prove probabilistically that there exists an integer solution close to the optimum of the relaxation solution. We then develop a methodology for converting such a probabilistic existence proof to a deterministic approximation algorithm. The methodology mimics the existence proof in a very strong sense.