Repositorio de producción científica de la Universidad de Sevilla
# The minimum Manhattan network problem approximations and exact solutions

JavaScript is disabled for your browser. Some features of this site may not work without it.

The minimum Manhattan network problem approximations and exact solutions

Author: |
Benkert, Marc
Shirabe, Takeshi Wolff, Alexander |

Date: | 2004 |

Document type: | Presentation |

Abstract: |
A Manhattan p–q path is a geodesic in the Manhattan (or L1-) metric that connects p and q, i.e. a staircase path between p and q. Given a set of
points P in the plane, a Manhattan network is a set of axis-parallel line segments that contains a Manh... [See more] |

Size:
132.3Kb

Format: PDF

Format: PDF

URI: http://hdl.handle.net/11441/55703

This work is under a Creative Commons License:

Attribution-NonCommercial-NoDerivatives 4.0 Internacional