scientific article; zbMATH DE number 7205018

DOI10.4230/LIPICS.ESA.2017.40zbMATH Open1442.05223arXiv1706.09185MaRDI QIDQ5111728FDOQ5111728

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 of this publication is not available (Why is that?)

zbMATH Keywords

dispersiondynamic programming\(k\)-centerparametric search

Mathematics Subject Classification ID

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

Cites Work

• A data structure for dynamic trees
• Title not available (Why is that?)
• Title not available (Why is that?)
• Finding kth paths and p-centers by generating and searching good data structures
• Slowing down sorting networks to obtain faster sorting algorithms
• An $O(n\log ^2 n)$ Algorithm for the kth Longest Path in a Tree with Applications to Location Problems
• Title not available (Why is that?)
• New Results on the Complexity of p-Centre Problems
• Title not available (Why is that?)
• Max-Min Tree Partitioning
• A Shifting Algorithm for Min-Max Tree Partitioning
• Design and Analysis of a Data Structure for Representing Sorted Lists
• A new data structure for representing sorted lists

Cited In (3)

• Maximum dispersion problem in dense graphs
• Title not available (Why is that?)
• The weighted \(k\)-center problem in trees for fixed \(k\)

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5111728)