Backup 2-center on interval graphs

Authors:
Yanmei Hong;Liying Kang
Affiliations:
Department of Mathematics, Fuzhou University, Fuzhou, 350108, China;Department of Mathematics, Shanghai University, Shanghai, 200444, China
Venue:
Theoretical Computer Science
Year:
2012

Citing 15
Cited 0

Slowing down sorting networks to obtain faster sorting algorithms

Journal of the ACM (JACM)
Efficient algorithms for optimization and selection on series-parallel graphs

SIAM Journal on Algebraic and Discrete Methods
An overview of representative problems in location research

Management Science
On some optimization problems on k-trees and partial k-trees

Discrete Applied Mathematics
Proper interval graphs and the guard problem

Discrete Mathematics
Solving NP-Hard Problems on Graphs That Are Almost Trees and an Application to Facility Location Problems

Journal of the ACM (JACM)
A linear-time algorithm for solving the center problem on weighted cactus graphs

Information Processing Letters
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
The obnoxious center problem on weighted cactus graphs

Discrete Applied Mathematics - The 1st cologne-twente workshop on graphs and combinatorial optimization (CTW 2001)
Scheduling with conflicts on bipartite and interval graphs

Journal of Scheduling - Special issue: On-line scheduling
An improved algorithm for the p-center problem on interval graphs with unit lengths

Computers and Operations Research
Reliability Models for Facility Location: The Expected Failure Cost Case

Transportation Science
The backup 2-center and backup 2-median problems on trees

Networks
Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms

Journal of Computer and System Sciences
Efficient algorithms for the weighted 2-center problem in a cactus graph

ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation

Quantified Score

Hi-index	5.23

Visualization

Abstract

A graph G is called an interval graph if there exists a set of intervals corresponding to the vertex set of G and two vertices are adjacent to each other if and only if the two corresponding intervals are intersecting with each other. In this paper, we apply the reliability-based backup 2-center modal proposed by Wang, Wu and Chao, in which each server may fail with a given probability, to interval graphs and present an O(n) time algorithm.