Approximating maximum weight \(K\)-colorable subgraphs in chordal graphs (Q976121): Difference between revisions

@@ Property / cites work @@
+A unified approach to approximating resource allocation and scheduling
+Normal rank
@@ Property / cites work @@
+Multi-phase algorithms for throughput maximization for real-time scheduling
+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 @@
+Q4093489
@@ Property / cites work: Q4093489 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3328583
@@ Property / cites work: Q3328583 / rank @@
+Normal rank
@@ Property / cites work @@
+Programming Languages and Systems
@@ Property / cites work: Programming Languages and Systems / rank @@
+Normal rank
@@ Property / cites work @@
+Algorithmic Aspects of Vertex Elimination on Graphs
+Normal rank
@@ Property / cites work @@
+Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs
+Normal rank
@@ Property / cites work @@
+The maximum k-colorable subgraph problem for chordal graphs
+Normal rank
@@ Property / cites work @@
+Linear degree extractors and the inapproximability of max clique and chromatic number
+Normal rank