3 search results - page 1 / 1 » A Simple 3-Approximation of Minimum Manhattan Networks |
COLOGNETWENTE
2008
13 years 6 months ago
2008
Given a set P of n points in the plane, a Manhattan network of P is a network that contains a rectilinear shortest path between every pair of points of P. A minimum Manhattan netw...
JCDCG
2004
Springer
13 years 10 months ago
2004
Springer
OL
2011
12 years 11 months ago
2011
Given a simple undirected graph, the minimum connected dominating set problem is to find a minimum cardinality subset of vertices D inducing a connected subgraph such that each ve...