An FPTAS for generalized absolute 1-center problem in vertex-weighted graphs

DOI10.1007/s10878-017-0130-4zbMath1383.90041OpenAlexW2606544095WikidataQ62043093 ScholiaQ62043093MaRDI QIDQ1679504

Ke Qiu, Wei Ding

Publication date: 9 November 2017

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

Full work available at URL: https://doi.org/10.1007/s10878-017-0130-4

zbMATH Keywords

FPTASvertex-weighted graphgeneralized absolute 1-center

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35)

Related Items (2)

A sifting-edges algorithm for accelerating the computation of absolute 1-center in graphs ⋮ Approximating the asymmetric \(p\)-center problem in parameterized complete digraphs

Cites Work

• Foundations of location analysis
• A new approach to all-pairs shortest paths on real-weighted graphs
• Approximating the Restricted 1-Center in 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: An FPTAS for generalized absolute 1-center problem in vertex-weighted graphs