𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On the approximability of some degree-constrained subgraph problems

✍ Scribed by Omid Amini; David Peleg; Stéphane Pérennes; Ignasi Sau; Saket Saurabh

Book ID
113564825
Publisher
Elsevier Science
Year
2012
Tongue
English
Weight
389 KB
Volume
160
Category
Article
ISSN
0166-218X

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the approximability of some maximum s
On the approximability of some maximum spanning tree problems
✍ Giulia Galbiati; Angelo Morzenti; Francesco Maffioli 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 844 KB

We study the approximability of some problems which aim at finding spanning trees in undirected graphs which maximize, rather than minimize, a single objective function representing a form of benefit or usefulness of the tree. We prove that the problem of finding a spanning tree which maximizes the