| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 428728 | Information Processing Letters | 2009 | 4 Pages |
Abstract
We prove that maximum weight branchings in directed graphs can be approximated in time O(m) up to a factor of 1−ε, where ε>0 is an arbitrary constant.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
