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

DOI10.1007/S10878-017-0130-4MaRDI QIDQ1679504zbMATH OpenOpenAlexWikidataFDO

Authors Wei Ding, Ke Qiu

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

FPTASgeneralized absolute 1-centervertex-weighted graph

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35)

Recommendations

• A sifting-edges algorithm for accelerating the computation of absolute 1-center in graphs
• Approximating the restricted 1-center in graphs
• Approximating the Restricted 1-Center in Graphs
• Publication:3800086
• Publication:4547480

Cites work

• A new approach to all-pairs shortest paths on real-weighted graphs
• An Algorithmic Approach to Network Location Problems. I: Thep-Centers
• Approximating the Restricted 1-Center in 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
• 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)

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

This page was built for publication: An FPTAS for generalized absolute 1-center problem in vertex-weighted graphs

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