Pages that link to "Item:Q3511430"
From MaRDI portal
The following pages link to A Fast 2-Approximation Algorithm for the Minimum Manhattan Network Problem (Q3511430):
Displaying 5 items.
- Minimum Manhattan network is NP-complete (Q540439) (← links)
- On minimum generalized Manhattan connections (Q832842) (← links)
- Fixed-parameter algorithms for rectilinear Steiner tree and rectilinear traveling salesman problem in the plane (Q1651693) (← links)
- Searching for realizations of finite metric spaces in tight spans (Q1799387) (← links)
- Minimum Manhattan network problem in normed planes with polygonal balls: a factor 2.5 approximation algorithm (Q2429332) (← links)
