A Survey and a New Competitive Method for the Planar min-# Problem

Details A Survey and a New Competitive Method for the Planar min-# Problem A Survey and a New Competitive Method for the Planar min-# Problem

2002-09-04

arxiv.org/abs/cs/0209007v2

Computer Science

Computational Geometry

preprint withdrawn

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

A Survey and a New Competitive Method for the Planar min-# Problem does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with A Survey and a New Competitive Method for the Planar min-# Problem, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A Survey and a New Competitive Method for the Planar min-# Problem will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-465936