The \(p\)-Maxian problem on interval graphs
type: Item
instance of: scholarly article
title: The \(p\)-Maxian problem on interval graphs
zbMATH Open document ID: 1215.05182
published in: Discrete Applied Mathematics
publication date: 2010-11-25T00:00:00Z
Mathematics Subject Classification ID: 05C85
zbMATH DE Number: 5819513
zbMATH Keywords: location theory
zbMATH Keywords: \(p\)-Maxian problem
zbMATH Keywords: obnoxious facility
zbMATH Keywords: interval graph
author: Yu-kun Cheng
author: Liying Kang
MaRDI profile type: Publication
full work available at URL: j.dam.2010.08.021
OpenAlex ID: W2016543547
cites work: Efficient algorithms for centers and medians in interval and circular-arc graphs
cites work: Dominating sets and domatic number of circular arc graphs
cites work: The \(p\)-maxian problem on a tree
cites work: An improved algorithm for the \(p\)-center problem on interval graphs with unit lengths
cites work: Solving the all-pair shortest path query problem on interval and circular-arc graphs
cites work: The discrete p-maxian location problem
cites work: The inverse 1-maxian problem with edge length modification
cites work: Interval graphs and related topics
cites work: Sum coloring interval and \(k\)-claw free graphs with application to scheduling dependent jobs
cites work: Scheduling with conflicts on bipartite and interval graphs
cites work: The \(p\)-maxian problem on block graphs
cites work: Parallel Prefix Computation
cites work: On the Algorithmic Complexity of Total Domination
cites work: Fast and simple algorithms to count the number of vertex covers in an interval graph
cites work: Obnoxious Facility Location on Graphs
cites work: Q5606538
DOI: 10.1016/J.DAM.2010.08.021
description: scientific article; zbMATH DE number 5819513