The weighted \(k\)-center problem in trees for fixed \(k\)
type: Item
instance of: scholarly article
title: The weighted \(k\)-center problem in trees for fixed \(k\)
author: Binay Bhattacharya
author: Sandip Das
author: S. Dev
published in: Theoretical Computer Science
publication date: 2022-02-21T00:00:00Z
Mathematics Subject Classification ID: 68Qxx
zbMATH DE Number: 7477133
zbMATH Keywords: \(k\)-center problem
zbMATH Keywords: facility location problem
zbMATH Keywords: parametric prune and search
MaRDI profile type: Publication
full work available at URL: j.tcs.2022.01.005
OpenAlex ID: W4206493951
cites work: Q5875588
cites work: An Algorithmic Approach to Network Location Problems. I: Thep-Centers
cites work: Improved Complexity Bounds for Center Location Problems on Networks by Using Dynamic Data Structures
cites work: Improved algorithms to network \(p\)-center location problems
cites work: Q3651735
cites work: Easy and hard bottleneck location problems
cites work: A Best Possible Heuristic for the k-Center Problem
cites work: A simple heuristic for the p-centre problem
cites work: A heuristic for the p-center problem in graphs
cites work: A 2-approximation algorithm and beyond for the minimum diameter \(k\)-Steiner forest problem
cites work: Approximating the asymmetric \(p\)-center problem in parameterized complete digraphs
cites work: AnO(log*n) Approximation Algorithm for the Asymmetricp-Center Problem
cites work: Asymmetric k -center is log * n -hard to approximate
cites work: Asymmetry in \(k\)-center variants
cites work: Algorithms for finding P-centers on a weighted tree (for relatively small P)
cites work: New Results on the Complexity of p-Centre Problems
cites work: The $p$-Center Problem in Tree Networks Revisited
cites work: An O(n log n)-Time Algorithm for the k-Center Problem in Trees
cites work: Linear-Time Algorithms for Linear Programming in $R^3 $ and Related Problems
cites work: An Optimal Algorithm for the Continuous/Discrete Weighted 2-Center Problem in Trees
cites work: Optimal Algorithms for the Weighted p-Center Problems on the Real Line for Small p
cites work: Q4037428
cites work: Some variations on constrained minimum enclosing circle problem
cites work: Q5111728
cites work: An \(O(n \log^2 n)\) algorithm for the optimal sink location problem in dynamic tree networks
cites work: Linear-time fitting of a \(k\)-step function
cites work: Efficient algorithms for center problems in cactus networks
DOI: 10.1016/J.TCS.2022.01.005
description: scientific article; zbMATH DE number 7477133