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

DOI10.1007/S10878-022-00866-XMaRDI QIDQ2165256zbMATH OpenOpenAlexFDO

Authors Wei Ding, Ke Qiu, Yu Zhou, Zhou Ye

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

absolute 1-centersaddle pointsifting edges

Mathematics Subject Classification ID

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

Recommendations

• An FPTAS for generalized absolute 1-center problem in vertex-weighted graphs
• Solving the absolute 1-center problem in the quickest path case
• An algorithm for finding the absolute center of a network
• Approximating the restricted 1-center in graphs
• scientific article; zbMATH DE number 4066949

Cites work

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

Cited in

(3)

• An FPTAS for generalized absolute 1-center problem in vertex-weighted graphs
• Solving the absolute 1-center problem in the quickest path case
• A polynomial time algorithm for finding the absolute center of a network

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

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