Backup 2-center on interval graphs
From MaRDI portal
Publication:442280
DOI10.1016/j.tcs.2012.05.003zbMath1243.68023OpenAlexW2046119322MaRDI QIDQ442280
Publication date: 10 August 2012
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2012.05.003
Graph theory (including graph drawing) in computer science (68R10) Mathematical problems of computer architecture (68M07)
Related Items
Embeddings into almost self-centered graphs of given radius, An optimal algorithm for the weighted backup 2-center problem on a tree, Backup multifacility location problem with \(l_p\) norm
Cites Work
- Unnamed Item
- Unnamed Item
- An improved algorithm for the \(p\)-center problem on interval graphs with unit lengths
- Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms
- On some optimization problems on \(k\)-trees and partial \(k\)-trees
- Parallel concepts in graph theory
- Proper interval graphs and the guard problem
- The obnoxious center problem on weighted cactus graphs.
- A linear-time algorithm for solving the center problem on weighted cactus graphs
- Sum coloring interval and \(k\)-claw free graphs with application to scheduling dependent jobs
- A fully dynamic graph algorithm for recognizing interval graphs
- Scheduling with conflicts on bipartite and interval graphs
- A simple linear-time algorithm for computing the center of an interval graph
- New Results on the Complexity of p-Centre Problems
- Algorithms for finding P-centers on a weighted tree (for relatively small P)
- Efficient Algorithms for Optimization and Selection on Series-Parallel Graphs
- Solving NP-Hard Problems on Graphs That Are Almost Trees and an Application to Facility Location Problems
- An Overview of Representative Problems in Location Research
- An Algorithmic Approach to Network Location Problems. I: Thep-Centers
- An $O(n\log ^2 n)$ Algorithm for the kth Longest Path in a Tree with Applications to Location Problems
- 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
- Slowing down sorting networks to obtain faster sorting algorithms
- Finding kth paths and p-centers by generating and searching good data structures
- The backup 2‐center and backup 2‐median problems on trees
- Algorithms and Computation
