Polynomial approximation and graph-coloring

DOI10.1007/s00607-002-1468-7zbMath1018.05029OpenAlexW2111086028MaRDI QIDQ1404543

Vangelis Th. Paschos

Publication date: 21 August 2003

Published in: Computing (Search for Journal in Brave)

Full work available at URL: https://basepub.dauphine.fr/handle/123456789/2103

zbMATH Keywords

complexityapproximation algorithmNP-complete

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Approximation methods and heuristics in mathematical programming (90C59) Coloring of graphs and hypergraphs (05C15) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25)

Related Items (4)

A survey on the structure of approximation classes ⋮ New potential functions for greedy independence and coloring ⋮ Combinatorial optimization in system configuration design ⋮ A simple approximation algorithm for WIS based on the approximability in \(k\)-partite graphs

This page was built for publication: Polynomial approximation and graph-coloring