✦ LIBER ✦

Finding optimum branchings

✍ Scribed by R. E. Tarjan

Publisher: John Wiley and Sons
Year: 1977
Tongue: English
Weight: 468 KB
Volume: 7
Category: Article
ISSN: 0028-3045
DOI: 10.1002/net.3230070103

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A note on finding optimum branchings

✍ P. M. Camerini; L. Fratta; F. Maffioli 📂 Article 📅 1979 🏛 John Wiley and Sons 🌐 English ⚖ 205 KB

A simple derivation of edmonds' algorith

A simple derivation of edmonds' algorithm for optimum branchings

✍ R. M. Karp 📂 Article 📅 1971 🏛 John Wiley and Sons 🌐 English ⚖ 266 KB

Small degree out-branchings

✍ Jørgen Bang-Jensen; Stéphan Thomassé; Anders Yeo 📂 Article 📅 2003 🏛 John Wiley and Sons 🌐 English ⚖ 98 KB

## Abstract Using a suitable orientation, we give a short proof of a strengthening of a result of Czumaj and Strothmann 4: Every 2‐edge‐connected graph __G__ contains a spanning tree __T__ with the property that $d\_T(v)\le {d\_T(v)+\,3 \over 2}$ for every vertex __v__. As an analogue of this resul

On edge-disjoint branchings

✍ D. R. Fulkerson; G. C. Harding 📂 Article 📅 1976 🏛 John Wiley and Sons 🌐 English ⚖ 330 KB

A 3-Approximation Algorithm for Finding

A 3-Approximation Algorithm for Finding Optimum 4,5-Vertex-Connected Spanning Subgraphs

✍ Yefim Dinitz; Zeev Nutov 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 103 KB

The problem of finding a minimum weight k-vertex connected spanning sub-Ž . graph in a graph G s V, E is considered. For k G 2, this problem is known to be NP-hard. Based on the paper of Auletta, Dinitz, Nutov, and Parente in this issue, Ä 4 we derive a 3-approximation algorithm for k g 4, 5 . This

A 2-Approximation Algorithm for Finding

A 2-Approximation Algorithm for Finding an Optimum 3-Vertex-Connected Spanning Subgraph

✍ Vincenzo Auletta; Yefim Dinitz; Zeev Nutov; Domenico Parente 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 71 KB

The problem of finding a minimum weight k-vertex connected spanning sub-Ž . graph in a graph G s V, E is considered. For k G 2, this problem is known to be NP-hard. Combining properties of inclusion-minimal k-vertex connected graphs Ž and of k-out-connected graphs i.e., graphs which contain a vertex