Constant-Time Approximation Algorithms for the Optimum Branching Problem on Sparse Graphs

Abstract

We propose constant-time algorithms for approximating the weight of the maximum weight branching in the general graph model. A directed graph is called a branching if it is acyclic and each vertex has at most one incoming edge. An edge-weighted digraph G, in which weights are given in real values in [0, 1], of average degree d is given as an oracle access… (More)
DOI: 10.1109/ICNC.2012.78

1 Figure or Table

Topics

  • Presentations referencing similar topics