Online algorithms for the maximum \(k\)-colorable subgraph problem (Q1652561): Difference between revisions

@@ Property / DOI @@
-.1016/j.cor.2017.10.003
@@ Property / DOI: 10.1016/j.cor.2017.10.003 / rank @@
-Normal rank
@@ Property / describes a project that uses @@
+Tabu search
@@ Property / describes a project that uses: Tabu search / 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.cor.2017.10.003
+Normal rank
@@ Property / OpenAlex ID @@
+W2761361573
@@ Property / OpenAlex ID: W2761361573 / rank @@
+Normal rank
@@ Property / cites work @@
+A general approach to online network optimization problems
+Normal rank
@@ Property / cites work @@
+New methods to color the vertices of a graph
@@ Property / cites work: New methods to color the vertices of a graph / rank @@
+Normal rank
@@ Property / cites work @@
+Online Dual Edge Coloring of Paths and Trees
@@ Property / cites work: Online Dual Edge Coloring of Paths and Trees / rank @@
+Normal rank
@@ Property / cites work @@
+Future paths for integer programming and links to artificial intelligence
+Normal rank
@@ Property / cites work @@
+On-line and first fit colorings of graphs
@@ Property / cites work: On-line and first fit colorings of graphs / rank @@
+Normal rank
@@ Property / cites work @@
+The smallest hard-to-color graph
@@ Property / cites work: The smallest hard-to-color graph / rank @@
+Normal rank
@@ Property / cites work @@
+Constructive algorithms for the partial directed weighted improper coloring problem
+Normal rank
@@ Property / cites work @@
+Using tabu search techniques for graph coloring
@@ Property / cites work: Using tabu search techniques for graph coloring / rank @@
+Normal rank
@@ Property / cites work @@
+The maximum \(k\)-colorable subgraph problem and orbitopes
+Normal rank
@@ Property / cites work @@
+A graph coloring algorithm for large scheduling problems
+Normal rank
@@ Property / cites work @@
+The node-deletion problem for hereditary properties is NP-complete
+Normal rank
@@ Property / cites work @@
+An on-line graph coloring algorithm with sublinear performance ratio
+Normal rank
@@ Property / cites work @@
+The approximation of maximum subgraph problems
@@ Property / cites work: The approximation of maximum subgraph problems / rank @@
+Normal rank
@@ Property / cites work @@
+On the recursive largest first algorithm for graph colouring
+Normal rank
@@ Property / cites work @@
+Weighted Bipartite Matching in Matrix Multiplication Time
+Normal rank
@@ Property / cites work @@
+An upper bound for the chromatic number of a graph and its application to timetabling problems
+Normal rank
@@ Property / DOI @@
+.1016/J.COR.2017.10.003
@@ Property / DOI: 10.1016/J.COR.2017.10.003 / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:1652561