Theoretical Computer Science

DOI10.1007/11560586zbMath1171.68611OpenAlexW2603408665MaRDI QIDQ5395073

Jérôme Monnot, Vangelis Th. Paschos, Bruno Escoffier

Publication date: 1 November 2006

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11560586

zbMATH Keywords

NP-complete problemsinterval graphspartial \(k\)-treeApproximation algorithmweighted coloringline graph of bipartite graphs

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Extremal problems in graph theory (05C35) Graph theory (including graph drawing) in computer science (68R10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Coloring of graphs and hypergraphs (05C15) Approximation algorithms (68W25)

Related Items (2)

Mobility offer allocations in corporate settings ⋮ Clique partitioning of interval graphs with submodular costs on the cliques

This page was built for publication: Theoretical Computer Science