Some approximation algorithms for the clique partition problem in weighted interval graphs (Q995565): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.tcs.2007.04.030
+Normal rank
@@ Property / OpenAlex ID @@
+W2019597617
@@ Property / OpenAlex ID: W2019597617 / rank @@
+Normal rank
@@ Property / cites work @@
+Restrictions of graph partition problems. I
@@ Property / cites work: Restrictions of graph partition problems. I / rank @@
+Normal rank
@@ Property / cites work @@
+On the \(k\)-coloring of intervals
@@ Property / cites work: On the \(k\)-coloring of intervals / rank @@
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3328583
@@ Property / cites work: Q3328583 / rank @@
+Normal rank
@@ Property / cites work @@
+Pathwidth, Bandwidth, and Completion Problems to Proper Interval Graphs with Small Cliques
+Normal rank
@@ Property / cites work @@
+Scheduling Interval-Ordered Tasks
@@ Property / cites work: Scheduling Interval-Ordered Tasks / rank @@
+Normal rank
@@ Property / cites work @@
+Q3898496
@@ Property / cites work: Q3898496 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3707420
@@ Property / cites work: Q3707420 / rank @@
+Normal rank
@@ Property / cites work @@
+Interval graphs and maps of DNA
@@ Property / cites work: Interval graphs and maps of DNA / rank @@
+Normal rank