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

DOI10.1007/S10878-017-0130-4zbMATH Open1383.90041OpenAlexW2606544095WikidataQ62043093 ScholiaQ62043093MaRDI QIDQ1679504FDOQ1679504

Authors: Wei Ding, Ke Qiu Edit this on Wikidata

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

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
• scientific article; zbMATH DE number 4066949
• scientific article; zbMATH DE number 1786156

zbMATH Keywords

FPTASgeneralized absolute 1-centervertex-weighted graph

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35)

Cites Work

• Optimum Locations of Switching Centers and the Absolute Centers and Medians of a Graph
• Fibonacci heaps and their uses in improved network optimization algorithms
• State of the Art—Location on Networks: A Survey. Part I: The p-Center and p-Median Problems
• A new approach to all-pairs shortest paths on real-weighted graphs
• An Algorithmic Approach to Network Location Problems. I: Thep-Centers
• Foundations of location analysis
• Finding the Hidden Path: Time Bounds for All-Pairs Shortest Paths
• Approximating the Restricted 1-Center in Graphs

Cited In (3)

• A sifting-edges algorithm for accelerating the computation of absolute 1-center in graphs
• Approximating the asymmetric \(p\)-center problem in parameterized complete digraphs
• Approximating the restricted 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)