TR07-119 Authors: Piotr Berman, Bhaskar DasGupta, Marek Karpinski

Publication: 5th December 2007 12:45

Downloads: 3159

Keywords:

We consider <i>minimum equivalent digraph</i> (<i>directed network</i>) problem (also known as the <i>strong transitive reduction</i>), its maximum optimization variant, and some extensions of those two types of problems. We prove the existence of polynomial time approximation algorithms with ratios 1.5 for all the minimization problems and 2 for all the maximization problems. We establish also approximation hardness result for those problems to within a constant even if the length of cycles is bounded by 5.