Sciweavers

WAOA   2007 Workshop Approximation and Online Algorithms
Wall of Fame | Most Viewed WAOA-2007 Paper
WAOA
2007
Springer
170views Algorithms» more  WAOA 2007»
14 years 5 months ago
A 5/3-Approximation for Finding Spanning Trees with Many Leaves in Cubic Graphs
For a connected graph G, let L(G) denote the maximum number of leaves in a spanning tree in G. The problem of computing L(G) is known to be NP-hard even for cubic graphs. We improv...
José R. Correa, Cristina G. Fernandes, Mart...
Disclaimer and Copyright Notice
Sciweavers respects the rights of all copyright holders and in this regard, authors are only allowed to share a link to their preprint paper on their own website. Every contribution is associated with a desciptive image. It is the sole responsibility of the authors to ensure that their posted image is not copyright infringing. This service is compliant with IEEE copyright.
IdReadViewsTitleStatus
1Download preprint from source170
2Download preprint from source158
3Download preprint from source132
4Download preprint from source132
5Download preprint from source126
6Download preprint from source120
7Download preprint from source109
8Download preprint from source109
9Download preprint from source106
10Download preprint from source104
11Download preprint from source103
12Download preprint from source92
13Download preprint from source89