A short note on the approximability of the maximum leaves spanning tree problem
Authors:
- 14 October 1994
- journal article
- Published by Elsevier in Information Processing Letters
- Vol. 52 (1) , 45-49
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- Proof verification and hardness of approximation problems1992
- Probabilistic checking of proofs; a new characterization of NP1992
- Optimization, approximation, and complexity classesJournal of Computer and System Sciences, 1991
- Completeness in approximation classesInformation and Computation, 1991
- Sur l'auto-stabilisation dans un réseau d'ordinateursRAIRO. Informatique théorique, 1981
- Approximation algorithms for combinatorial problemsJournal of Computer and System Sciences, 1974
- Self-stabilizing systems in spite of distributed controlCommunications of the ACM, 1974