A Survey and a New Competitive Method for the Planar min-# Problem
<|reference_start|>A Survey and a New Competitive Method for the Planar min-# Problem: We survey most of the different types of approximation algorithms which minimize the number of output vertices. We present their main qualities and their inherent drawbacks.<|reference_end|>
@article{buzer2002a,
    title={A Survey and a New Competitive Method for the Planar min-# Problem},
    author={Lilian Buzer},
    journal={arXiv preprint arXiv:cs/0209007},
    year={2002},
    archivePrefix={arXiv},
    eprint={cs/0209007},
    primaryClass={cs.CG}
}