Weighted coloring: further complexity and approximability results
type: Item
instance of: scholarly article
title: Weighted coloring: further complexity and approximability results
zbMATH Open document ID: 1181.68173
published in: Information Processing Letters
publication date: 2009-12-18T00:00:00Z
full work available at URL: https://basepub.dauphine.fr/handle/123456789/2128
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 05C15
Mathematics Subject Classification ID: 05C35
Mathematics Subject Classification ID: 05C70
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 68W25
zbMATH DE Number: 5650179
zbMATH Keywords: approximation algorithms
zbMATH Keywords: NP-complete problems
zbMATH Keywords: weighted coloring
zbMATH Keywords: interval graphs
zbMATH Keywords: line graph of bipartite graphs
zbMATH Keywords: partial \(k\)-tree
author: Bruno Escoffier
author: Jérôme Monnot
author: Vangelis Th. Paschos
MaRDI profile type: Publication
OpenAlex ID: W1498089635
cites work: Q3941433
cites work: Q5431779
cites work: Q4414490
cites work: Algorithms and Computation
cites work: The Complexity of Coloring Circular Arcs and Chords
cites work: A coloring problem for weighted graphs
cites work: Generalized coloring for tree-like graphs
cites work: Algorithmic complexity of list colorings
cites work: Q5501309
cites work: Automata, Languages and Programming
DOI: 10.1016/J.IPL.2005.09.013
description: scientific article; zbMATH DE number 5650179