A sifting-edges algorithm for accelerating the computation of absolute 1-center in graphs

DOI10.1007/s10878-022-00866-xzbMath1497.90169OpenAlexW4280619077MaRDI QIDQ2165256

Yu Zhou, Wei Ding, Zhou Ye, Ke Qiu

Publication date: 19 August 2022

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-022-00866-x

zbMATH Keywords

saddle pointabsolute 1-centersifting edges

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Combinatorial optimization (90C27)

Cites Work

• Unnamed Item
• Algorithms for the minimum diameter terminal Steiner tree problem
• On the minimum diameter spanning tree problem
• Foundations of location analysis
• Network location of a reliable center using the most reliable route policy
• An FPTAS for generalized absolute 1-center problem in vertex-weighted graphs
• A new approach to all-pairs shortest paths on real-weighted graphs
• State of the Art—Location on Networks: A Survey. Part I: The p-Center and p-Median Problems
• An Algorithmic Approach to Network Location Problems. I: Thep-Centers
• Finding the Hidden Path: Time Bounds for All-Pairs Shortest Paths
• Fibonacci heaps and their uses in improved network optimization algorithms
• Optimum Locations of Switching Centers and the Absolute Centers and Medians of a Graph

This page was built for publication: A sifting-edges algorithm for accelerating the computation of absolute 1-center in graphs