Approximating optimum branchings in linear time

  • Authors:

  • Valentin Ziegler

  • Affiliations:

  • Humboldt Universität zu Berlin, Institut für Informatik, 10099 Berlin, Germany

  • Venue:
  • Information Processing Letters
  • Year:
  • 2009

Quantified Score

Hi-index 0.89

Visualization

Abstract

We prove that maximum weight branchings in directed graphs can be approximated in time O(m) up to a factor of 1-@e, where @e0 is an arbitrary constant.