On minimum generalized Manhattan connections
From MaRDI portal
Publication:832842
DOI10.1007/978-3-030-83508-8_7OpenAlexW3194055463MaRDI QIDQ832842
Parinya Chalermsook, Peter Kling, Lukas Nölke, Margarita Capretto, Christoph Damerius, Joachim Spoerhase, Nidia Obscura Acosta, Antonios Foivos Antoniadis
Publication date: 25 March 2022
Full work available at URL: https://arxiv.org/abs/2010.14338
Cites Work
- Unnamed Item
- Unnamed Item
- Improved approximation algorithms for directed Steiner forest
- Minimum Manhattan network is NP-complete
- Approximating the generalized minimum Manhattan network problem
- Algorithmic graph theory and perfect graphs
- Approximating minimum Manhattan networks in higher dimensions
- A rounding algorithm for approximating minimum Manhattan networks
- Design networks with bounded pairwise distance
- Set connectivity problems in undirected graphs and the directed steiner network problem
- Self-Adjusting Binary Search Trees: What Makes Them Tick?
- A Fast 2-Approximation Algorithm for the Minimum Manhattan Network Problem
- Self-adjusting binary search trees
- On the Dynamic Finger Conjecture for Splay Trees. Part II: The Proof
- Weighted dynamic finger in binary search trees
- Dynamic Optimality—Almost
