Max-leaves spanning tree is APX-hard for cubic graphs

✍ Scribed by Paul Bonsma

• Book ID: 113699052
• Publisher: Elsevier Science
• Year: 2012
• Tongue: English
• Weight: 267 KB
• Volume: 12
• Category: Article
• ISSN: 1570-8667
• DOI: 10.1016/j.jda.2011.06.005