The connected p-center problem on cactus graphs

DOI10.1016/J.TCS.2017.09.028zbMATH Open1421.90124OpenAlexW2760665898MaRDI QIDQ1630992FDOQ1630992

Authors: Erfang Shan, Chun-song Bai, Liying Kang 

Publication date: 5 December 2018

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2017.09.028

Recommendations

• The connected \(p\)-center problem on cactus graphs
• The connected \(p\)-center problem on block graphs with forbidden vertices
• scientific article; zbMATH DE number 4173027
• scientific article; zbMATH DE number 5205606
• Efficient algorithms for center problems in cactus networks

zbMATH Keywords

dynamic programmingcactus graphlocation problemconnected \(p\)-center problem

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Dynamic programming (90C39)

Cites Work

• Improved Complexity Bounds for Center Location Problems on Networks by Using Dynamic Data Structures
• An Algorithmic Approach to Network Location Problems. II: Thep-Medians
• Efficient algorithms for centers and medians in interval and circular-arc graphs
• Title not available (Why is that?)
• The connected \(p\)-center problem on block graphs with forbidden vertices
• Title not available (Why is that?)
• Structured \(p\)-facility location problems on the line solvable in polynomial time
• A simple linear-time algorithm for computing the center of an interval graph

Cited In (15)

• The inverse connected \(p\)-median problem on block graphs under various cost functions
• The connected \(p\)-median problem on complete multi-layered graphs
• A simple greedy approximation algorithm for the minimum connected \(k\)-center problem
• The complete vertex \(p\)-center problem
• The connected \(p\)-center problem on cactus graphs
• Title not available (Why is that?)
• Approximability results for the converse connected \(p\)-centre problem
• The 2-maxian problem on cactus graphs
• Computing the center of uncertain points on cactus graphs
• Title not available (Why is that?)
• The obnoxious center problem on weighted cactus graphs.
• The connected \(p\)-center problem on block graphs with forbidden vertices
• Efficient algorithms for center problems in cactus networks
• A linear time algorithm for connected \(p\)-centdian problem on block graphs
• A linear time algorithm for the \(p\)-maxian problem on trees with distance constraint

This page was built for publication: The connected \(p\)-center problem on cactus graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1630992)