A Survey and a New Competitive Method for the Planar min-# Problem
Computational Geometry
2009-09-29 v2
Abstract
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.
Cite
@article{arxiv.cs/0209007,
title = {A Survey and a New Competitive Method for the Planar min-# Problem},
author = {Lilian Buzer},
journal= {arXiv preprint arXiv:cs/0209007},
year = {2009}
}
Comments
preprint withdrawn