Pages that link to "Item:Q2748154"
From MaRDI portal
The following pages link to Approximating a minimum Manhattan network (Q2748154):
Displaying 19 items.
- Minimum Manhattan network is NP-complete (Q540439) (← links)
- 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)
- Light orthogonal networks with constant geometric dilation (Q1013080) (← links)
- Approximating the generalized minimum Manhattan network problem (Q1751089) (← 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)
- Approximation algorithms for network design problems (Q2920753) (← links)
- Finding a manhattan path and related problems (Q3313268) (← links)
- A Fast 2-Approximation Algorithm for the Minimum Manhattan Network Problem (Q3511430) (← links)
- The Minimal Manhattan Network Problem in Three Dimensions (Q3605512) (← links)
- An algorithm for the minimum variance point of a network (Q3971963) (← links)
- The Minimum Manhattan Network Problem: A Fast Factor-3 Approximation (Q5449750) (← links)
- Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques (Q5479357) (← links)
- Dynamic programming approach to the generalized minimum Manhattan network problem (Q5918463) (← links)
