scientific article; zbMATH DE number 1953087

zbMath1022.68092MaRDI QIDQ4414490

Jérôme Monnot, Dominique de Werra, Vangelis Th. Paschos, Marc Demange

Publication date: 25 July 2003

Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2573/25730114.htm

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Coloring of graphs and hypergraphs (05C15) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (20)

The assignment problem with nearly Monge arrays and incompatible partner indices ⋮ On the max-weight edge coloring problem ⋮ Open shop scheduling with synchronization ⋮ A note on the Cornaz-Jost transformation to solve the graph coloring problem ⋮ Dual parameterization of Weighted Coloring ⋮ A Semi-exact Algorithm for Quickly Computing A Maximum Weight Clique in Large Sparse Graphs ⋮ A hypocoloring model for batch scheduling ⋮ On the probabilistic minimum coloring and minimum \(k\)-coloring ⋮ Approximation algorithms for the maximum Hamiltonian path problem with specified endpoint(s) ⋮ The maximum saving partition problem ⋮ On the Maximum Edge Coloring Problem ⋮ Ruling out FPT algorithms for weighted coloring on forests ⋮ Max-coloring of vertex-weighted graphs ⋮ A one-to-one correspondence between colorings and stable sets ⋮ Differential approximation of NP-hard problems with equal size feasible solutions ⋮ Weighted coloring on planar, bipartite and split graphs: Complexity and approximation ⋮ Weighted coloring: further complexity and approximability results ⋮ Dual parameterization of weighted coloring ⋮ Parameterized complexity of list coloring and max coloring ⋮ Scheduling on a batch processing machine with split compatibility graphs

This page was built for publication: