Randomized greedy: new variants of some classic approximation algorithms

@inproceedings{Costello2011RandomizedGN,
  title={Randomized greedy: new variants of some classic approximation algorithms},
  author={Kevin P. Costello and Asaf Shapira and Prasad Tetali},
  booktitle={SODA},
  year={2011}
}
We consider the performance of two classic approximation algorithms which work by scanning the input and greedily constructing a solution. We investigate whether running these algorithms on a random permutation of the input can increase their performance ratio. We obtain the following results: 1. Johnson's approximation algorithm for MAX-SAT is one of the first approximation algorithms to be rigorously analyzed. It has been shown that the performance ratio of this algorithm is 2/3. We show… CONTINUE READING
6 Citations
6 References
Similar Papers

Similar Papers

Loading similar papers…