Improved approximations for maximum independent set via approximation chains (Q1372278): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / cites work @@
+Efficient bounds for the stable set, vertex cover and set packing problems
+Normal rank
@@ Property / cites work @@
+A \((\Delta / 2)\)-approximation algorithm for the maximum independent set problem
+Normal rank
@@ Property / cites work @@
+Greed is good
@@ Property / cites work: Greed is good / rank @@
+Normal rank
@@ Property / cites work @@
+Q4698692
@@ Property / cites work: Q4698692 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3128896
@@ Property / cites work: Q3128896 / rank @@
+Normal rank
@@ Property / cites work @@
+Vertex packings: Structural properties and algorithms
+Normal rank
@@ Property / cites work @@
+On Turan's theorem for sparse graphs
@@ Property / cites work: On Turan's theorem for sparse graphs / rank @@
+Normal rank
@@ Property / cites work @@
+On Syntactic versus Computational Views of Approximability
+Normal rank
@@ Property / cites work @@
+A note on the independence number of triangle-free graphs
+Normal rank
@@ Property / cites work @@
+A note on the independence number of triangle-free graphs. II
+Normal rank
@@ Property / cites work @@
+Q5781249
@@ Property / cites work: Q5781249 / rank @@
+Normal rank
@@ Property / cites work @@
+Three short proofs in graph theory
@@ Property / cites work: Three short proofs in graph theory / rank @@
+Normal rank
@@ Property / cites work @@
+On Approximate Solutions for Combinatorial Optimization Problems
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/s0893-9659(97)00044-x
+Normal rank
@@ Property / OpenAlex ID @@
+W2164654851
@@ Property / OpenAlex ID: W2164654851 / rank @@
+Normal rank