Approximation algorithms for combinatorial problems (Q1213733): Difference between revisions

@@ Property / Wikidata QID @@
+Q56338199
@@ Property / Wikidata QID: Q56338199 / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / cites work @@
+Q4138187
@@ Property / cites work: Q4138187 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4133108
@@ Property / cites work: Q4133108 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4142699
@@ Property / cites work: Q4142699 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5670645
@@ Property / cites work: Q5670645 / rank @@
+Normal rank
@@ Property / cites work @@
+An upper bound for the chromatic number of a graph and its application to timetabling problems
+Normal rank
@@ Property / cites work @@
+A technique for colouring a graph applicable to large scale timetabling problems
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/s0022-0000(74)80044-9
+Normal rank
@@ Property / OpenAlex ID @@
+W2040924621
@@ Property / OpenAlex ID: W2040924621 / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:1213733