Approximating the Restricted 1-Center in Graphs
From MaRDI portal
Publication:3467877
DOI10.1007/978-3-319-26626-8_47zbMath1474.68220OpenAlexW2406451447MaRDI QIDQ3467877
Publication date: 5 February 2016
Published in: Combinatorial Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-26626-8_47
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Approximation algorithms (68W25)
Related Items (1)
Cites Work
- 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
- An Algorithmic Approach to Network Location Problems. I: Thep-Centers
- Approximation Schemes for the Restricted Shortest Path Problem
- Finding the Hidden Path: Time Bounds for All-Pairs Shortest Paths
- 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