Vertex Cover in Graphs with Locally Few Colors (Q3012828): Difference between revisions

@@ Property / cites work @@
+Single machine precedence constrained scheduling is a Vertex cover problem
+Normal rank
@@ Property / cites work @@
+Scheduling with Precedence Constraints of Low Fractional Dimension
+Normal rank
@@ Property / cites work @@
+Approximating Precedence-Constrained Single Machine Scheduling by Coloring
+Normal rank
@@ Property / cites work @@
+Inapproximability Results for Maximum Edge Biclique, Minimum Linear Arrangement, and Sparsest Cut
+Normal rank
@@ Property / cites work @@
+Q3002828
@@ Property / cites work: Q3002828 / rank @@
+Normal rank
@@ Property / cites work @@
+Optimal Long Code Test with One Free Bit
@@ Property / cites work: Optimal Long Code Test with One Free Bit / rank @@
+Normal rank
@@ Property / cites work @@
+Fractional dimension of partial orders
@@ Property / cites work: Fractional dimension of partial orders / rank @@
+Normal rank
@@ Property / cites work @@
+Precedence constrained scheduling to minimize sum of weighted completion times on a single machine
+Normal rank
@@ Property / cites work @@
+A half-integral linear programming relaxation for scheduling precedence-constrained jobs on a single machine
+Normal rank
@@ Property / cites work @@
+Single-Machine Scheduling with Precedence Constraints
+Normal rank
@@ Property / cites work @@
+On the hardness of approximating minimum vertex cover
+Normal rank
@@ Property / cites work @@
+Partially Ordered Sets
@@ Property / cites work: Partially Ordered Sets / rank @@
+Normal rank
@@ Property / cites work @@
+Coloring graphs with locally few colors
@@ Property / cites work: Coloring graphs with locally few colors / rank @@
+Normal rank
@@ Property / cites work @@
+On the fractional dimension of partially ordered sets
+Normal rank
@@ Property / cites work @@
+Dimension, graph and hypergraph coloring
@@ Property / cites work: Dimension, graph and hypergraph coloring / rank @@
+Normal rank
@@ Property / cites work @@
+Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
+Normal rank
@@ Property / cites work @@
+Scheduling to Minimize Average Completion Time: Off-Line and On-Line Approximation Algorithms
+Normal rank
@@ Property / cites work @@
+Greed is good: Approximating independent sets in sparse and bounded-degree graphs
+Normal rank
@@ Property / cites work @@
+Improved Approximation Algorithms for the Vertex Cover Problem in Graphs and Hypergraphs
+Normal rank
@@ Property / cites work @@
+Efficient bounds for the stable set, vertex cover and set packing problems
+Normal rank
@@ Property / cites work @@
+A better approximation ratio for the vertex cover problem
+Normal rank
@@ Property / cites work @@
+Approximate graph coloring by semidefinite programming
+Normal rank
@@ Property / cites work @@
+On the power of unique 2-prover 1-round games
@@ Property / cites work: On the power of unique 2-prover 1-round games / rank @@
+Normal rank
@@ Property / cites work @@
+Vertex cover might be hard to approximate to within \(2 - \varepsilon \)
+Normal rank
@@ Property / cites work @@
+The Lovász Theta Function and a Semidefinite Programming Relaxation of Vertex Cover
+Normal rank
@@ Property / cites work @@
+Local chromatic number and Sperner capacity
@@ Property / cites work: Local chromatic number and Sperner capacity / rank @@
+Normal rank
@@ Property / cites work @@
+Sequencing Jobs to Minimize Total Weighted Completion Time Subject to Precedence Constraints
+Normal rank
@@ Property / cites work @@
+Complexity of Scheduling under Precedence Constraints
+Normal rank
@@ Property / cites work @@
+Decompositions, Network Flows, and a Precedence Constrained Single-Machine Scheduling Problem
+Normal rank
@@ Property / cites work @@
+Vertex packings: Structural properties and algorithms
+Normal rank
@@ Property / cites work @@
+An algorithm for the single machine sequencing problem with precedence constraints
+Normal rank
@@ Property / cites work @@
+Polynomial time approximation algorithms for machine scheduling: Ten open problems
+Normal rank