scientific article; zbMATH DE number 7205018

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

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

dynamic programmingdispersionparametric search\(k\)-center

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Trees (05C05) Dynamic programming (90C39) Distance in graphs (05C12) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (1)

The weighted \(k\)-center problem in trees for fixed \(k\)

Cites Work

• 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
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: