123 search results - page 1 / 25 » The minimum Manhattan network problem: Approximations and ex... |
86
Voted
COMGEO
2006
ACM
14 years 9 months ago
2006
ACM
COLOGNETWENTE
2008
14 years 11 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...
78
Voted
INFORMS
2008
14 years 9 months ago
2008
We propose an exact solution method for a routing and capacity installation problem in networks. Given an input graph, the problem is to route traffic from a set of source nodes t...
70
Voted
ESA
2003
Springer
15 years 2 months ago
2003
Springer
Let G = (V, E) be an undirected graph, with three numbers d0(e) ≥ d1(e) ≥ d2(e) ≥ 0 for each edge e ∈ E. A solution is a subset U ⊆ V and di(e) represents the cost contr...