Improved Results on Models of Greedy and Primal-dual Algorithms Improved Results on Models of Greedy and Primal-dual Algorithms Improved Results on Models of Greedy and Primal-dual Algorithms Table of Contents

@inproceedings{Edmonds2008ImprovedRO,
  title={Improved Results on Models of Greedy and Primal-dual Algorithms Improved Results on Models of Greedy and Primal-dual Algorithms Improved Results on Models of Greedy and Primal-dual Algorithms Table of Contents},
  author={Jeff Edmonds and Suprakash Datta and Patrick W. Dymond and S. Watson},
  year={2008}
}
A class of priority algorithms that capture reasonable gree dy-like algorithms was introduced by Borodin, Nielson, and Rackoff [7]. Later, Borodin, Cashman, and Magen [4] introduced the stack algorithms, advocating that they capt ure reasonable primal-dual and local-ratio algorithms. In this thesis, some NP -hard graph optimization problems Maximum Acyclic… CONTINUE READING