𝔖 Bobbio Scriptorium

✦ LIBER ✦

A 3/2-Approximation Algorithm for Finding Spanning Trees with Many Leaves in Cubic Graphs

✍ Scribed by Bonsma, Paul; Zickfeld, Florian

Book ID: 118197141
Publisher: Society for Industrial and Applied Mathematics
Year: 2011
Tongue: English
Weight: 231 KB
Volume: 25
Category: Article
ISSN: 0895-4801
DOI: 10.1137/100801251

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An approximation algorithm for finding a

An approximation algorithm for finding ad-regular spanning connected subgraph of maximum weight in a complete graph with random weights of edges

✍ A. E. Baburin; E. Kh. Gimadi 📂 Article 📅 2008 🏛 Pleiades Publishing 🌐 English ⚖ 713 KB