A fixed-parameter algorithm for the minimum Manhattan network problem
<p>A Manhattan network for a finite set <em>P</em> of points in the plane is a geometric graph such that its vertex set contains <em>P</em>, its edges are axis-parallel and non-crossing and, for any two points <em>p</em> and<em>q</em> in <em&g...
Main Authors: | Christian Knauer, Andreas Spillner |
---|---|
Format: | Article |
Language: | English |
Published: |
Carleton University
2011-12-01
|
Series: | Journal of Computational Geometry |
Online Access: | http://jocg.org/index.php/jocg/article/view/43 |
Similar Items
-
Minimum Manhattan Distance Approach to Multiple Criteria Decision Making in Multiobjective Optimization Problems
by: Teng-Kuei Juan, et al.
Published: (2017) -
A Mixture of Manhattan Frames: Beyond the Manhattan World
by: Straub, Julian, et al.
Published: (2015) -
Consumer identification with consumer problems, Manhattan, Kansas
by: Waddell, Frederick Emerson.
Published: (2015) -
Manhattan interlude
by: Osmun, James Lommason
Published: (2011) -
Minimum cost network flows: Problems, algorithms, and software
by: Sifaleras Angelo
Published: (2013-01-01)