Balancing graph Voronoi diagrams with one more vertex

DOI10.1002/net.22198arXiv2211.03146MaRDI QIDQ6196878

Guillaume Ducoffe

Publication date: 15 March 2024

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2211.03146

zbMATH Keywords

graph algorithmsfacility location problemsgraph Voronoi diagramsHS-hardness

Mathematics Subject Classification ID

Mathematical programming (90Cxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Voronoi game on graphs
• The level ancestor problem simplified
• Algorithms for graphs of bounded treewidth via orthogonal range searching
• Decomposable searching problems
• The weighted farthest color Voronoi diagram on trees and graphs.
• A simple 3-sweep LBFS algorithm for the recognition of unit interval graphs
• A new algorithm for optimal 2-constraint satisfaction and its implications
• Undirected single-source shortest paths with positive integer weights in linear time
• Optimal Distance Labeling for Interval Graphs and Related Graph Families
• The Voronoi Partition of a Network and Its Implications in Location Theory
• A faster approximation algorithm for the Steiner problem in graphs

This page was built for publication: Balancing graph Voronoi diagrams with one more vertex