On the max coloring problem (Q690449): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.tcs.2012.07.037
+Normal rank
@@ Property / OpenAlex ID @@
+W2156187051
@@ Property / OpenAlex ID: W2156187051 / rank @@
+Normal rank
@@ Property / cites work @@
+Approximation and Online Algorithms
@@ Property / cites work: Approximation and Online Algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+An improved algorithm for online coloring of intervals with bandwidth
+Normal rank
@@ Property / cites work @@
+Approximating the max-edge-coloring problem
@@ Property / cites work: Approximating the max-edge-coloring problem / rank @@
+Normal rank
@@ Property / cites work @@
+Scheduling a batching machine
@@ Property / cites work: Scheduling a batching machine / rank @@
+Normal rank
@@ Property / cites work @@
+On some packing problem related to dynamic storage allocation
+Normal rank
@@ Property / cites work @@
+Time slot scheduling of compatible jobs
@@ Property / cites work: Time slot scheduling of compatible jobs / rank @@
+Normal rank
@@ Property / cites work @@
+Automata, Languages and Programming
@@ Property / cites work: Automata, Languages and Programming / rank @@
+Normal rank
@@ Property / cites work @@
+Weighted coloring: further complexity and approximability results
+Normal rank
@@ Property / cites work @@
+Batch processing with interval graph compatibilities between tasks
+Normal rank
@@ Property / cites work @@
+Q3328583
@@ Property / cites work: Q3328583 / rank @@
+Normal rank
@@ Property / cites work @@
+Geometric algorithms and combinatorial optimization.
+Normal rank
@@ Property / cites work @@
+A coloring problem for weighted graphs
@@ Property / cites work: A coloring problem for weighted graphs / rank @@
+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 @@
+Batch Coloring Flat Graphs and Thin
@@ Property / cites work: Batch Coloring Flat Graphs and Thin / rank @@
+Normal rank
@@ Property / cites work @@
+pretty graph colouring problems
@@ Property / cites work: 25 pretty graph colouring problems / rank @@
+Normal rank
@@ Property / cites work @@
+Max-Coloring Paths: Tight Bounds and Extensions
@@ Property / cites work: Max-Coloring Paths: Tight Bounds and Extensions / rank @@
+Normal rank
@@ Property / cites work @@
+The Linearity of First-Fit Coloring of Interval Graphs
+Normal rank
@@ Property / cites work @@
+Coloring interval graphs with First-Fit
@@ Property / cites work: Coloring interval graphs with First-Fit / rank @@
+Normal rank
@@ Property / cites work @@
+Q3950561
@@ Property / cites work: Q3950561 / rank @@
+Normal rank
@@ Property / cites work @@
+Approximation algorithm for minimizing total latency in machine scheduling with deliveries
+Normal rank
@@ Property / cites work @@
+An on-line graph coloring algorithm with sublinear performance ratio
+Normal rank
@@ Property / cites work @@
+Improved approximation algorithms for the max edge-coloring problem
+Normal rank
@@ Property / cites work @@
+On the max-weight edge coloring problem
@@ Property / cites work: On the max-weight edge coloring problem / rank @@
+Normal rank
@@ Property / cites work @@
+A note on first-fit coloring of interval graphs
@@ Property / cites work: A note on first-fit coloring of interval graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Clique Clustering Yields a PTAS for max-Coloring Interval Graphs
+Normal rank
@@ Property / cites work @@
+Approximating interval coloring and max-coloring in chordal graphs
+Normal rank
@@ Property / cites work @@
+Automata, Languages and Programming
@@ Property / cites work: Automata, Languages and Programming / rank @@
+Normal rank
@@ Property / cites work @@
+Q5501309
@@ Property / cites work: Q5501309 / rank @@
+Normal rank
@@ Property / cites work @@
+Combinatorial optimization. Polyhedra and efficiency (3 volumes)
+Normal rank
@@ Property / cites work @@
+Weighted coloring on planar, bipartite and split graphs: Complexity and approximation
+Normal rank