The following pages link to Algorithms and Computation (Q5897858):
Displaying 11 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)
- An \(O(mn)\) algorithm for the 1-maximin problem on a network (Q1304521) (← 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)
- A rounding algorithm for approximating minimum Manhattan networks (Q2474072) (← links)
- A Fast 2-Approximation Algorithm for the Minimum Manhattan Network Problem (Q3511430) (← links)
- The Minimal Manhattan Network Problem in Three Dimensions (Q3605512) (← links)
- The Minimum Manhattan Network Problem: A Fast Factor-3 Approximation (Q5449750) (← links)
- Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques (Q5479357) (← links)