Approximation of min coloring by moderately exponential algorithms (Q989534): Difference between revisions

@@ Property / author @@
+Nicolas Bourgeois
@@ Property / author: Nicolas Bourgeois / rank @@
+Normal rank
@@ Property / author @@
+Vangelis Th. Paschos
@@ Property / author: Vangelis Th. Paschos / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W2159978956
@@ Property / OpenAlex ID: W2159978956 / rank @@
+Normal rank
@@ Property / cites work @@
+Completeness in standard and differential approximation classes: Poly-(D)APX- and (D)PTAS-completeness
+Normal rank
@@ Property / cites work @@
+Q3941433
@@ Property / cites work: Q3941433 / rank @@
+Normal rank
@@ Property / cites work @@
+Efficient Approximation of Combinatorial Problems by Moderately Exponential Algorithms
+Normal rank
@@ Property / cites work @@
+Efficient approximation of Min Set Cover by moderately exponential algorithms
+Normal rank
@@ Property / cites work @@
+Enumerating maximal independent sets with applications to graph colouring.
+Normal rank
@@ Property / cites work @@
+Improved approximations for weighted and unweighted graph problems
+Normal rank
@@ Property / cites work @@
+Q2768314
@@ Property / cites work: Q2768314 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4778579
@@ Property / cites work: Q4778579 / rank @@
+Normal rank
@@ Property / cites work @@
+Measure and conquer
@@ Property / cites work: Measure and conquer / rank @@
+Normal rank
@@ Property / cites work @@
+A still better performance guarantee for approximate graph coloring
+Normal rank
@@ Property / cites work @@
+Q4938668
@@ Property / cites work: Q4938668 / rank @@
+Normal rank
@@ Property / cites work @@
+z-Approximations
@@ Property / cites work: z-Approximations / rank @@
+Normal rank
@@ Property / cites work @@
+Approximation algorithms for combinatorial problems
+Normal rank
@@ Property / cites work @@
+Linear degree extractors and the inapproximability of max clique and chromatic number
+Normal rank