The following pages link to A catalog of Hanan grid problems (Q2748382):
Displaying 9 items.
- Minimum Manhattan network is NP-complete (Q540439) (← links)
- Delay-related secondary objectives for rectilinear Steiner minimum trees. (Q1427185) (← links)
- Speeding up the Dreyfus-Wagner algorithm for minimum Steiner trees (Q2466792) (← links)
- A rounding algorithm for approximating minimum Manhattan networks (Q2474072) (← links)
- Approximation Schemes for Capacitated Geometric Network Design (Q3012789) (← links)
- Approximation Algorithms for Buy-at-Bulk Geometric Network Design (Q3183450) (← links)
- APPROXIMATION ALGORITHMS FOR BUY-AT-BULK GEOMETRIC NETWORK DESIGN (Q3224959) (← links)
- Approximation Schemes for Capacitated Geometric Network Design (Q4556954) (← links)
- Grid recognition: classical and parameterized computational perspectives (Q6156159) (← links)
