On local search for the generalized graph coloring problem (Q1870000): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / cites work @@
+Scheduling to Minimize Interaction Cost
@@ Property / cites work: Scheduling to Minimize Interaction Cost / rank @@
+Normal rank
@@ Property / cites work @@
+Approximate Max-Flow Min-(Multi)Cut Theorems and Their Applications
+Normal rank
@@ Property / cites work @@
+Q4526964
@@ Property / cites work: Q4526964 / rank @@
+Normal rank
@@ Property / cites work @@
+How easy is local search?
@@ Property / cites work: How easy is local search? / rank @@
+Normal rank
@@ Property / cites work @@
+Q4259987
@@ Property / cites work: Q4259987 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4142699
@@ Property / cites work: Q4142699 / rank @@
+Normal rank
@@ Property / cites work @@
+An Efficient Heuristic Procedure for Partitioning Graphs
+Normal rank
@@ Property / cites work @@
+Q4871783
@@ Property / cites work: Q4871783 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4194705
@@ Property / cites work: Q4194705 / rank @@
+Normal rank
@@ Property / cites work @@
+P-Complete Approximation Problems
@@ Property / cites work: P-Complete Approximation Problems / rank @@
+Normal rank
@@ Property / cites work @@
+Simple Local Search Problems that are Hard to Solve
+Normal rank
@@ Property / cites work @@
+Q4365127
@@ Property / cites work: Q4365127 / rank @@
+Normal rank