On Shortest Networks for Classes of Points in the Plane

@inproceedings{Ihler1991OnSN,
  title={On Shortest Networks for Classes of Points in the Plane},
  author={Edmund Ihler and Gabriele Reich and Peter Widmayer},
  booktitle={Workshop on Computational Geometry},
  year={1991}
}
We are given a set P of points in the plane, together with a partition of P into classes of points; i.e., each point of P belongs to exactly one class. For a given network optimization problem, such as nding a minimum spanning tree or nding a minimum diameter spanning tree, we study the problem of choosing a subset P 0 of P that contains at least one point of each class and solving the network optimization problem for P 0 , such that the solution is optimal among all possible choices for P 0… CONTINUE READING

Similar Papers

Loading similar papers…