The \(p\)-Maxian problem on interval graphs

DOI10.1016/j.dam.2010.08.021zbMath1215.05182OpenAlexW2016543547MaRDI QIDQ608284

Li-ying Kang, Yu-kun Cheng

Publication date: 25 November 2010

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2010.08.021

zbMATH Keywords

location theoryinterval graph\(p\)-Maxian problemobnoxious facility

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (5)

A linear time algorithm for the \(p\)-maxian problem on trees with distance constraint ⋮ The backup 2-median problem on block graphs ⋮ A modified optimal algorithm for 2-maxian location problems on cactus graphs ⋮ Public facility location using dispersion, population, and equity criteria ⋮ The 2-maxian problem on cactus graphs

Cites Work

• Unnamed Item
• The \(p\)-maxian problem on block graphs
• Fast and simple algorithms to count the number of vertex covers in an interval graph
• An improved algorithm for the \(p\)-center problem on interval graphs with unit lengths
• The inverse 1-maxian problem with edge length modification
• Interval graphs and related topics
• Dominating sets and domatic number of circular arc graphs
• The discrete p-maxian location problem
• Sum coloring interval and \(k\)-claw free graphs with application to scheduling dependent jobs
• Scheduling with conflicts on bipartite and interval graphs
• The \(p\)-maxian problem on a tree
• On the Algorithmic Complexity of Total Domination
• Parallel Prefix Computation
• Obnoxious Facility Location on Graphs
• Efficient algorithms for centers and medians in interval and circular-arc graphs
• Solving the all-pair shortest path query problem on interval and circular-arc graphs

This page was built for publication: The \(p\)-Maxian problem on interval graphs