Publication:868984

DOI10.1016/J.COR.2005.08.013zbMATH Open1112.05097OpenAlexW2032392714MaRDI QIDQ868984FDOQ868984

N. E. Zubov

Publication date: 26 February 2007

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2005.08.013

zbMATH Keywords

location

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Combinatorial optimization (90C27)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Optimum Locations of Switching Centers and the Absolute Centers and Medians of a Graph
• Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms
• State of the Art—Location on Networks: A Survey. Part I: The p-Center and p-Median Problems
• Improved Complexity Bounds for Center Location Problems on Networks by Using Dynamic Data Structures
• An Algorithmic Approach to Network Location Problems. I: Thep-Centers
• Efficient algorithms for centers and medians in interval and circular-arc graphs
• Parallel Prefix Computation
• An Overview of Representative Problems in Location Research
• Solving the all-pair shortest path query problem on interval and circular-arc graphs
• 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
• Sum coloring interval and \(k\)-claw free graphs with application to scheduling dependent jobs
• Scheduling with conflicts on bipartite and interval graphs

Cited In (8)

• The \(p\)-Maxian problem on interval graphs
• Backup 2-center on interval graphs
• Modelling gateway placement in wireless networks: geometric \(k\)-centres of unit disc graphs
• The connected \(p\)-center problem on block graphs with forbidden vertices
• Optimal sequential and parallel algorithms for computing the diameter and the center of an interval graph
• Enhancements to two exact algorithms for solving the vertex \(P\)-center problem
• On the Solution Value of the Continuous p-Center Location Problem on a Graph
• On some inverse 1-center location problems

Recommendations

• Efficient algorithms for centers and medians in interval and circular-arc graphs 👍 👎
• A heuristic for the p-center problem in graphs 👍 👎
• Improved algorithms to network \(p\)-center location problems 👍 👎
• A simple linear-time algorithm for computing the center of an interval graph 👍 👎
• Optimal sequential and parallel algorithms for computing the diameter and the center of an interval graph 👍 👎
• Optimal algorithms for the \(\alpha\)-neighbor \(p\)-center problem 👍 👎
• Un nuevo resultado sobre la complejidad del problema delP-centro 👍 👎
• Improved algorithms for some competitive location centroid problems on paths, trees and graphs 👍 👎
• A finite algorithm for the continuousp-center location problem on a graph 👍 👎

This page was built for publication: An improved algorithm for the \(p\)-center problem on interval graphs with unit lengths

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