Experimental analysis of approximation algorithms for the vertex cover and set covering problems (Q2496053): Difference between revisions

@@ Property / cites work @@
+Computational experience with approximation algorithms for the set covering problem
+Normal rank
@@ Property / cites work @@
+Designing and reporting on computational experiments with heuristic methods
+Normal rank
@@ Property / cites work @@
+Q4460278
@@ Property / cites work: Q4460278 / rank @@
+Normal rank
@@ Property / cites work @@
+Resynchronization for multiprocessor DSP systems
@@ Property / cites work: Resynchronization for multiprocessor DSP systems / rank @@
+Normal rank
@@ Property / cites work @@
+Modeling and Solving the Crew Rostering Problem
@@ Property / cites work: Modeling and Solving the Crew Rostering Problem / rank @@
+Normal rank
@@ Property / cites work @@
+Adapting Branch-and-Bound for Real-World Scheduling Problems
+Normal rank
@@ Property / cites work @@
+Efficient bounds for the stable set, vertex cover and set packing problems
+Normal rank
@@ Property / cites work @@
+Vertex packings: Structural properties and algorithms
+Normal rank
@@ Property / cites work @@
+Approximation Algorithms for the Set Covering and Vertex Cover Problems
+Normal rank
@@ Property / cites work @@
+A linear-time approximation algorithm for the weighted vertex cover problem
+Normal rank
@@ Property / cites work @@
+A Greedy Heuristic for the Set-Covering Problem
@@ Property / cites work: A Greedy Heuristic for the Set-Covering Problem / rank @@
+Normal rank