The weighted \(k\)-center problem in trees for fixed \(k\)
From MaRDI portal
Publication:2077394
DOI10.1016/j.tcs.2022.01.005OpenAlexW4206493951MaRDI QIDQ2077394
Binay K. Bhattacharya, Sandip Das, Subhadeep Ranjan Dev
Publication date: 21 February 2022
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2022.01.005
Cites Work
- Improved algorithms to network \(p\)-center location problems
- A simple heuristic for the p-centre problem
- An \(O(n \log^2 n)\) algorithm for the optimal sink location problem in dynamic tree networks
- A heuristic for the p-center problem in graphs
- Easy and hard bottleneck location problems
- Some variations on constrained minimum enclosing circle problem
- Linear-time fitting of a \(k\)-step function
- Approximating the asymmetric \(p\)-center problem in parameterized complete digraphs
- A 2-approximation algorithm and beyond for the minimum diameter \(k\)-Steiner forest problem
- Efficient algorithms for center problems in cactus networks
- Asymmetry in \(k\)-center variants
- An Optimal Algorithm for the Continuous/Discrete Weighted 2-Center Problem in Trees
- Asymmetric k -center is log * n -hard to approximate
- Optimal Algorithms for the Weighted p-Center Problems on the Real Line for Small p
- Linear-Time Algorithms for Linear Programming in $R^3 $ and Related Problems
- New Results on the Complexity of p-Centre Problems
- A Best Possible Heuristic for the k-Center Problem
- Algorithms for finding P-centers on a weighted tree (for relatively small P)
- 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
- An O(n log n)-Time Algorithm for the k-Center Problem in Trees
- The $p$-Center Problem in Tree Networks Revisited
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: The weighted \(k\)-center problem in trees for fixed \(k\)
