Max-leaves spanning tree is APX-hard for cubic graphs. Bonsma, P. S. J. Discrete Algorithms (JDA), 12:14-23, 2012. ![Max-leaves spanning tree is APX-hard for cubic graphs [link]](https://bibbase.org/img/filetypes/link.svg "link")
Paper bibtex @article{ dblp2265580,
title = {Max-leaves spanning tree is APX-hard for cubic graphs},
author = {Paul S. Bonsma},
author_short = {Bonsma, P. S.},
bibtype = {article},
type = {article},
year = {2012},
key = {dblp2265580},
id = {dblp2265580},
biburl = {http://www.dblp.org/rec/bibtex/journals/jda/Bonsma12},
url = {http://dx.doi.org/10.1016/j.jda.2011.06.005},
journal = {J. Discrete Algorithms (JDA)},
pages = {14-23},
volume = {12},
text = {J. Discrete Algorithms (JDA) 12:14-23 (2012)}
}
Downloads: 0
{"_id":{"_str":"52430439b1392ed14300169e"},"__v":53,"authorIDs":["545735e62abc8e9f370001a2"],"author_short":["Bonsma, P. S."],"bibbaseid":"bonsma-maxleavesspanningtreeisapxhardforcubicgraphs-2012","bibdata":{"title":"Max-leaves spanning tree is APX-hard for cubic graphs","author":["Paul S. Bonsma"],"author_short":["Bonsma, P. S."],"bibtype":"article","type":"article","year":"2012","key":"dblp2265580","id":"dblp2265580","biburl":"http://www.dblp.org/rec/bibtex/journals/jda/Bonsma12","url":"http://dx.doi.org/10.1016/j.jda.2011.06.005","journal":"J. Discrete Algorithms (JDA)","pages":"14-23","volume":"12","text":"J. Discrete Algorithms (JDA) 12:14-23 (2012)","bibtex":"@article{ dblp2265580,\n title = {Max-leaves spanning tree is APX-hard for cubic graphs},\n author = {Paul S. Bonsma},\n author_short = {Bonsma, P. S.},\n bibtype = {article},\n type = {article},\n year = {2012},\n key = {dblp2265580},\n id = {dblp2265580},\n biburl = {http://www.dblp.org/rec/bibtex/journals/jda/Bonsma12},\n url = {http://dx.doi.org/10.1016/j.jda.2011.06.005},\n journal = {J. Discrete Algorithms (JDA)},\n pages = {14-23},\n volume = {12},\n text = {J. Discrete Algorithms (JDA) 12:14-23 (2012)}\n}","bibbaseid":"bonsma-maxleavesspanningtreeisapxhardforcubicgraphs-2012","role":"author","urls":{"Paper":"http://dx.doi.org/10.1016/j.jda.2011.06.005"},"downloads":0,"html":""},"bibtype":"article","biburl":"http://www.dblp.org/rec/bibtex/journals/jda/Bonsma12","downloads":0,"keywords":[],"search_terms":["max","leaves","spanning","tree","apx","hard","cubic","graphs","bonsma"],"title":"Max-leaves spanning tree is APX-hard for cubic graphs","year":2012,"dataSources":["qQ4jyEeLiNFtFpdPN"]}