Pages that link to "Item:Q2258071"
From MaRDI portal
The following pages link to Approximating minimum Manhattan networks in higher dimensions (Q2258071):
Displaying 13 items.
- Linear-size planar Manhattan network for convex point sets (Q824337) (← links)
- On minimum generalized Manhattan connections (Q832842) (← links)
- A fast algorithm for connectivity graph approximation using modified Manhattan distance in dynamic networks (Q945254) (← links)
- The transitive minimum Manhattan subnetwork problem in 3 dimensions (Q968145) (← links)
- Approximating the generalized minimum Manhattan network problem (Q1751089) (← links)
- Optimal realizations and the block decomposition of a finite metric space (Q2043363) (← links)
- Approximating minimum Manhattan networks in higher dimensions (Q2258071) (← links)
- Minimum Manhattan network problem in normed planes with polygonal balls: a factor 2.5 approximation algorithm (Q2429332) (← links)
- (Q3092216) (redirect page) (← links)
- The Multidimensional Manhattan Network (Q3503496) (← links)
- The Minimal Manhattan Network Problem in Three Dimensions (Q3605512) (← links)
- Bidirected minimum Manhattan network problem (Q4565780) (← links)
- Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques (Q5479357) (← links)