Approximation algorithms for the max-coloring problem
From MaRDI portal
Recommendations
Cited in
(37)- Weighted coloring on planar, bipartite and split graphs: Complexity and approximation
- Weighted coloring: further complexity and approximability results
- Saving colors and max coloring: some fixed-parameter tractability results
- Conversion of coloring algorithms into maximum weight independent set algorithms
- On approximate graph colouring and MAX-k-CUT algorithms based on the -function
- Improved approximation algorithms for the max edge-coloring problem
- On Monte Carlo tree search for weighted vertex coloring
- On-line partitioning of width \(w\) posets into \(w^{O(\log\log w)}\) chains
- Clique partitioning with value-monotone submodular cost
- Bounded max-colorings of graphs
- Inapproximability and approximability of maximal tree routing and coloring
- Iterated local search with tabu search for the weighted vertex coloring problem
- Exact Algorithms for Weighted Coloring in Special Classes of Tree and Cactus Graphs
- Approximation Algorithms for Bounded Color Matchings via Convex Decompositions
- Clique Clustering Yields a PTAS for max-Coloring Interval Graphs
- Saving colors and max coloring: some fixed-parameter tractability results
- An Approximation Algorithm for the Smallest Color-Spanning Circle Problem
- Approximating interval coloring and max-coloring in chordal graphs
- Batch Coloring Flat Graphs and Thin
- On the Maximum Edge Coloring Problem
- Max-coloring paths: tight bounds and extensions
- Max-coloring paths: tight bounds and extensions
- On the Max Coloring Problem
- scientific article; zbMATH DE number 6469191 (Why is no real title available?)
- scientific article; zbMATH DE number 7650095 (Why is no real title available?)
- Algorithms and Computation
- Max-coloring of vertex-weighted graphs
- On the max-weight edge coloring problem
- Monte Carlo tree search with adaptive simulation: a case study on weighted vertex coloring
- On the max coloring problem
- Towards more efficient local search for weighted graph coloring problem in massive graphs
- Clique clustering yields a PTAS for max-coloring interval graphs
- On-line chain partitions of orders: a survey
- Capacitated max-batching with interval graph compatibilities
- Almost optimal solutions for bin coloring problems
- Approximating the max-edge-coloring problem
- Approximation of min coloring by moderately exponential algorithms
This page was built for publication: Approximation algorithms for the max-coloring problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5716853)