A short note on the approximability of the maximum leaves spanning tree problem

Arora, 1992, Proof verification and hardness of approximation problems, Proc. 33rd Ann. IEEE Symp. on Foundations of Computer Science, 14, 10.1109/SFCS.1992.267823 Arora, 1992, Probabilistic checking of proofs: A new characterization of NP, Proc. 33rd Ann. IEEE Symp. on Foundations of Computer Science, 2, 10.1109/SFCS.1992.267824 Crescenzi, 1991, Completeness in approximation classes, Inform. and Comput., 93, 241, 10.1016/0890-5401(91)90025-W Dijkstra, 1974, Self-stabilizing systems in spite of distributed control, Comm. ACM, 17, 643, 10.1145/361179.361202 Garey, 1979 Lu, 1992, The power of local optimization: Approximation algorithms for Maximum-Leaf Spanning Tree, Proc. Allerton Conf., 533 Johnson, 1974, Approximation algorithms for combinatorial problems, J. Comput. System Sci., 9, 256, 10.1016/S0022-0000(74)80044-9 Papadimitriou, 1991, Optimization, approximation, and complexity classes, J. Comput. System Sci., 43, 425, 10.1016/0022-0000(91)90023-X Tchuente, 1981, Sur l'auto-stabilisation dans un réseau d'odinateurs, RAIRO Inform. Théor., 15, 47, 10.1051/ita/1981150100471