Backup 2-center on interval graphs (Q442280): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.tcs.2012.05.003
+Normal rank
@@ Property / OpenAlex ID @@
+W2046119322
@@ Property / OpenAlex ID: W2046119322 / rank @@
+Normal rank
@@ Property / cites work @@
+Algorithms and Computation
@@ Property / cites work: Algorithms and Computation / rank @@
+Normal rank
@@ Property / cites work @@
+Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms
+Normal rank
@@ Property / cites work @@
+An Overview of Representative Problems in Location Research
+Normal rank
@@ Property / cites work @@
+Efficient algorithms for centers and medians in interval and circular-arc graphs
+Normal rank
@@ Property / cites work @@
+Slowing down sorting networks to obtain faster sorting algorithms
+Normal rank
@@ Property / cites work @@
+Solving the all-pair shortest path query problem on interval and circular-arc graphs
+Normal rank
@@ Property / cites work @@
+Proper interval graphs and the guard problem
@@ Property / cites work: Proper interval graphs and the guard problem / rank @@
+Normal rank
@@ Property / cites work @@
+An improved algorithm for the \(p\)-center problem on interval graphs with unit lengths
+Normal rank
@@ Property / cites work @@
+Q4037428
@@ Property / cites work: Q4037428 / rank @@
+Normal rank
@@ Property / cites work @@
+Finding kth paths and p-centers by generating and searching good data structures
+Normal rank
@@ Property / cites work @@
+On some optimization problems on \(k\)-trees and partial \(k\)-trees
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+Solving NP-Hard Problems on Graphs That Are Almost Trees and an Application to Facility Location Problems
+Normal rank
@@ Property / cites work @@
+Parallel concepts in graph theory
@@ Property / cites work: Parallel concepts in graph theory / rank @@
+Normal rank
@@ Property / cites work @@
+Efficient Algorithms for Optimization and Selection on Series-Parallel Graphs
+Normal rank
@@ Property / cites work @@
+Sum coloring interval and \(k\)-claw free graphs with application to scheduling dependent jobs
+Normal rank
@@ Property / cites work @@
+Scheduling with conflicts on bipartite and interval graphs
+Normal rank
@@ Property / cites work @@
+Algorithms for finding P-centers on a weighted tree (for relatively small P)
+Normal rank
@@ Property / cites work @@
+An Algorithmic Approach to Network Location Problems. I: The<i>p</i>-Centers
+Normal rank
@@ Property / cites work @@
+A linear-time algorithm for solving the center problem on weighted cactus graphs
+Normal rank
@@ Property / cites work @@
+A fully dynamic graph algorithm for recognizing interval graphs
+Normal rank
@@ Property / cites work @@
+New Results on the Complexity of <i>p</i>-Centre Problems
+Normal rank
@@ Property / cites work @@
+An $O(n\log ^2 n)$ Algorithm for the <i>k</i>th Longest Path in a Tree with Applications to Location Problems
+Normal rank
@@ Property / cites work @@
+A simple linear-time algorithm for computing the center of an interval graph
+Normal rank
@@ Property / cites work @@
+The backup 2‐center and backup 2‐median problems on trees
+Normal rank
@@ Property / cites work @@
+The obnoxious center problem on weighted cactus graphs.
+Normal rank