Approximating the restricted 1-center in graphs

DOI10.1016/j.tcs.2016.04.044zbMath1425.68308OpenAlexW2418872760WikidataQ62043096 ScholiaQ62043096MaRDI QIDQ2424875

Ke Qiu, Wei Ding

Publication date: 25 June 2019

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2016.04.044

zbMATH Keywords

saddle pointFPTASrestricted shortest pathrestricted 1-center

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Approximation algorithms (68W25)

Cites Work

• Unnamed Item
• Unnamed Item
• Foundations of location analysis
• An improved FPTAS for Restricted Shortest Path.
• 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
• Approximation of Pareto Optima in Multiple-Objective, Shortest-Path Problems
• Approximation Schemes for the Restricted Shortest Path Problem
• Finding the Hidden Path: Time Bounds for All-Pairs Shortest Paths
• Fibonacci heaps and their uses in improved network optimization algorithms
• The network inhibition problem
• Optimum Locations of Switching Centers and the Absolute Centers and Medians of a Graph
• A simple efficient approximation scheme for the restricted shortest path problem

This page was built for publication: Approximating the restricted 1-center in graphs