On minimum generalized Manhattan connections
From MaRDI portal
Cites work
- A Fast 2-Approximation Algorithm for the Minimum Manhattan Network Problem
- A rounding algorithm for approximating minimum Manhattan networks
- Algorithmic graph theory and perfect graphs
- Approximating a minimum Manhattan network
- Approximating the generalized minimum Manhattan network problem
- Design networks with bounded pairwise distance
- Dynamic Optimality—Almost
- Improved approximation algorithms for directed Steiner forest
- Minimum Manhattan network is NP-complete
- On the Dynamic Finger Conjecture for Splay Trees. Part II: The Proof
- Self-adjusting binary search trees
- Self-adjusting binary search trees: what makes them tick?
- Set connectivity problems in undirected graphs and the directed Steiner network problem
- The geometry of binary search trees
- Weighted dynamic finger in binary search trees
This page was built for publication: On minimum generalized Manhattan connections
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q832842)