Pages that link to "Item:Q2432734"
From MaRDI portal
The following pages link to The minimum Manhattan network problem: Approximations and exact solutions (Q2432734):
Displayed 14 items.
- Minimum Manhattan network is NP-complete (Q540439) (← links)
- Linear-size planar Manhattan network for convex point sets (Q824337) (← links)
- The transitive minimum Manhattan subnetwork problem in 3 dimensions (Q968145) (← links)
- Light orthogonal networks with constant geometric dilation (Q1013080) (← links)
- Exact algorithms for the order picking problem (Q1782167) (← links)
- Searching for realizations of finite metric spaces in tight spans (Q1799387) (← 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)
- The minimum Manhattan network problem: Approximations and exact solutions (Q2432734) (← links)
- A rounding algorithm for approximating minimum Manhattan networks (Q2474072) (← links)
- GREEDY CONSTRUCTION OF 2-APPROXIMATE MINIMUM MANHATTAN NETWORKS (Q3089095) (← links)
- A Fast 2-Approximation Algorithm for the Minimum Manhattan Network Problem (Q3511430) (← links)
- The Minimal Manhattan Network Problem in Three Dimensions (Q3605512) (← links)
- Light Euclidean Spanners with Steiner Points (Q5874539) (← links)