The \(p\)-Maxian problem on interval graphs (Q608284): Difference between revisions

@@ Property / DOI @@
-.1016/j.dam.2010.08.021
@@ Property / DOI: 10.1016/j.dam.2010.08.021 / rank @@
-Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.dam.2010.08.021
+Normal rank
@@ Property / OpenAlex ID @@
+W2016543547
@@ Property / OpenAlex ID: W2016543547 / rank @@
+Normal rank
@@ Property / cites work @@
+Efficient algorithms for centers and medians in interval and circular-arc graphs
+Normal rank
@@ Property / cites work @@
+Dominating sets and domatic number of circular arc graphs
+Normal rank
@@ Property / cites work @@
+The \(p\)-maxian problem on a tree
@@ Property / cites work: The \(p\)-maxian problem on a tree / 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 @@
+Solving the all-pair shortest path query problem on interval and circular-arc graphs
+Normal rank
@@ Property / cites work @@
+The discrete p-maxian location problem
@@ Property / cites work: The discrete p-maxian location problem / rank @@
+Normal rank
@@ Property / cites work @@
+The inverse 1-maxian problem with edge length modification
+Normal rank
@@ Property / cites work @@
+Interval graphs and related topics
@@ Property / cites work: Interval graphs and related topics / rank @@
+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 @@
+The \(p\)-maxian problem on block graphs
@@ Property / cites work: The \(p\)-maxian problem on block graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Parallel Prefix Computation
@@ Property / cites work: Parallel Prefix Computation / rank @@
+Normal rank
@@ Property / cites work @@
+On the Algorithmic Complexity of Total Domination
@@ Property / cites work: On the Algorithmic Complexity of Total Domination / rank @@
+Normal rank
@@ Property / cites work @@
+Fast and simple algorithms to count the number of vertex covers in an interval graph
+Normal rank
@@ Property / cites work @@
+Obnoxious Facility Location on Graphs
@@ Property / cites work: Obnoxious Facility Location on Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q5606538
@@ Property / cites work: Q5606538 / rank @@
+Normal rank
@@ Property / DOI @@
+.1016/J.DAM.2010.08.021
@@ Property / DOI: 10.1016/J.DAM.2010.08.021 / rank @@
+Normal rank