Approximating the asymmetric \(p\)-center problem in parameterized complete digraphs
From MaRDI portal
Publication:2185812
DOI10.1007/s10878-020-00559-3zbMath1445.90092OpenAlexW3012366300MaRDI QIDQ2185812
Publication date: 5 June 2020
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10878-020-00559-3
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Improved algorithms to network \(p\)-center location problems
- Algorithms for the minimum diameter terminal Steiner tree problem
- A simple heuristic for the p-centre problem
- An improved approximation algorithm for the asymmetric TSP with strengthened triangle inequality
- On the relationship between ATSP and the cycle cover problem
- A heuristic for the p-center problem in graphs
- Easy and hard bottleneck location problems
- An FPTAS for generalized absolute 1-center problem in vertex-weighted graphs
- The hardness and approximation of the star \(p\)-hub center problem
- A 2-approximation algorithm and beyond for the minimum diameter \(k\)-Steiner forest problem
- Asymmetry in \(k\)-center variants
- An improved approximation algorithm for the ATSP with parameterized triangle inequality
- Asymmetric k-center is log * n -hard to approximate
- A (slightly) faster algorithm for klee's measure problem
- A Best Possible Heuristic for the k-Center Problem
- Improved Complexity Bounds for Center Location Problems on Networks by Using Dynamic Data Structures
- An Algorithmic Approach to Network Location Problems. I: Thep-Centers
- AnO(log*n) Approximation Algorithm for the Asymmetricp-Center Problem
- Optimum Distribution of Switching Centers in a Communication Network and Some Related Graph Theoretic Problems
- Optimum Locations of Switching Centers and the Absolute Centers and Medians of a Graph
This page was built for publication: Approximating the asymmetric \(p\)-center problem in parameterized complete digraphs
