The connected \(p\)-center problem on cactus graphs
type: Item
instance of: scholarly article
title: The connected \(p\)-center problem on cactus graphs
zbMATH Open document ID: 1421.90124
author: Erfang Shan
author: Chun-song Bai
author: Liying Kang
published in: Theoretical Computer Science
publication date: 2018-12-05T00:00:00Z
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90C39
zbMATH DE Number: 6989362
zbMATH Keywords: location problem
zbMATH Keywords: connected \(p\)-center problem
zbMATH Keywords: cactus graph
zbMATH Keywords: dynamic programming
MaRDI profile type: Publication
full work available at URL: j.tcs.2017.09.028
OpenAlex ID: W2760665898
cites work: Efficient algorithms for centers and medians in interval and circular-arc graphs
cites work: Q4037428
cites work: Structured \(p\)-facility location problems on the line solvable in polynomial time
cites work: An Algorithmic Approach to Network Location Problems. II: Thep-Medians
cites work: A simple linear-time algorithm for computing the center of an interval graph
cites work: Improved Complexity Bounds for Center Location Problems on Networks by Using Dynamic Data Structures
cites work: The connected \(p\)-center problem on block graphs with forbidden vertices
cites work: Q5422574
DOI: 10.1016/J.TCS.2017.09.028
description: scientific article; zbMATH DE number 6989362