The connected \(p\)-center problem on block graphs with forbidden vertices
type: Item
instance of: scholarly article
title: The connected \(p\)-center problem on block graphs with forbidden vertices
zbMATH Open document ID: 1238.68064
author: William Chung-Kung Yen
published in: Theoretical Computer Science
publication date: 2012-05-30T00:00:00Z
Mathematics Subject Classification ID: 68Q17
Mathematics Subject Classification ID: 05C12
Mathematics Subject Classification ID: 05C85
Mathematics Subject Classification ID: 68R10
zbMATH DE Number: 6039140
zbMATH Keywords: connected \(p\)-centers
zbMATH Keywords: block graphs
zbMATH Keywords: block degrees
zbMATH Keywords: NP-hard
zbMATH Keywords: graphs with forbidden vertices
describes a project that uses: MOD-DIST
describes a project that uses: MENU-OKF
describes a project that uses: SITATION
MaRDI profile type: Publication
full work available at URL: j.tcs.2011.12.013
OpenAlex ID: W2080445370
cites work: A characterization of block graphs
cites work: Efficient algorithms for center problems in cactus networks
cites work: Efficient algorithms for centers and medians in interval and circular-arc graphs
cites work: Optimal Algorithms for the Path/Tree-Shaped Facility Location Problems in Trees
cites work: Center problems with pos/neg weights on trees
cites work: An improved algorithm for the \(p\)-center problem on interval graphs with unit lengths
cites work: Asymmetric k -center is log * n -hard to approximate
cites work: What you should know about location modeling
cites work: Q4857376
cites work: A simple heuristic for the p-centre problem
cites work: A 1-center problem on the plane with uniformly distributed demand points
cites work: Q4037428
cites work: Q4198056
cites work: Asymmetric \(k\)-center with minimum coverage
cites work: Structured \(p\)-facility location problems on the line solvable in polynomial time
cites work: An Algorithmic Approach to Network Location Problems. I: Thep-Centers
cites work: A linear-time algorithm for solving the center problem on weighted cactus graphs
cites work: Linear-Time Algorithms for Linear Programming in $R^3 $ and Related Problems
cites work: An $O(n\log ^2 n)$ Algorithm for the kth Longest Path in a Tree with Applications to Location Problems
cites work: A simple linear-time algorithm for computing the center of an interval graph
cites work: AnO(log*n) Approximation Algorithm for the Asymmetricp-Center Problem
cites work: Center location problems on tree graphs with subtree-shaped customers
cites work: A bibliography for some fundamental problem categories in discrete location science
cites work: Improved Complexity Bounds for Center Location Problems on Networks by Using Dynamic Data Structures
cites work: The centdian subtree on tree networks
cites work: Conditional location of path and tree shaped facilities on trees
cites work: State of the Art—Location on Networks: A Survey. Part I: The p-Center and p-Median Problems
cites work: Q5422574
DOI: 10.1016/J.TCS.2011.12.013
description: scientific article; zbMATH DE number 6039140