Publication:5111728
From MaRDI portal
DOI10.4230/LIPIcs.ESA.2017.40zbMath1442.05223arXiv1706.09185MaRDI QIDQ5111728
Oren Weimann, Nadav Krasnopolsky, Paweł Gawrychowski, Shay Mozes
Publication date: 27 May 2020
Full work available at URL: https://arxiv.org/abs/1706.09185
68W40: Analysis of algorithms
05C05: Trees
90C39: Dynamic programming
05C12: Distance in graphs
05C85: Graph algorithms (graph-theoretic aspects)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A new data structure for representing sorted lists
- A data structure for dynamic trees
- New Results on the Complexity of p-Centre Problems
- Design and Analysis of a Data Structure for Representing Sorted Lists
- Max-Min Tree Partitioning
- An $O(n\log ^2 n)$ Algorithm for the kth Longest Path in a Tree with Applications to Location Problems
- A Shifting Algorithm for Min-Max Tree Partitioning
- Slowing down sorting networks to obtain faster sorting algorithms
- Finding kth paths and p-centers by generating and searching good data structures