A better list heuristic for vertex cover (Q963417): Difference between revisions

@@ Property / DOI @@
-.1016/j.ipl.2008.02.004
@@ Property / DOI: 10.1016/j.ipl.2008.02.004 / rank @@
-Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.ipl.2008.02.004
+Normal rank
@@ Property / OpenAlex ID @@
+W1991790827
@@ Property / OpenAlex ID: W1991790827 / rank @@
+Normal rank
@@ Property / cites work @@
+A list heuristic for vertex cover
@@ Property / cites work: A list heuristic for vertex cover / rank @@
+Normal rank
@@ Property / cites work @@
+On-line vertex-covering
@@ Property / cites work: On-line vertex-covering / rank @@
+Normal rank
@@ Property / cites work @@
+On the hardness of approximating minimum vertex cover
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+Automata, Languages and Programming
@@ Property / cites work: Automata, Languages and Programming / rank @@
+Normal rank
@@ Property / DOI @@
+.1016/J.IPL.2008.02.004
@@ Property / DOI: 10.1016/J.IPL.2008.02.004 / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:963417