Abstract:Let G = (V, E) be an edge weighted geometric graph such that every edge is horizontal or vertical. The weight of an edge uv ∈ E is its length. Let W G (u, v) denote the length of a shortest path between a pair of vertices u and v in G. The graph G is said to be a Manhattan network for a given point set P in the plane if P ⊆ V and ∀p, q ∈ P , W G (p, q) = pq 1 . In addition to P , graph G may also include a set T of Steiner points in its vertex set V . In the Manhattan network problem, the objective is to const… Show more
Set email alert for when this publication receives citations?
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.