scientific article; zbMATH DE number 1929928

zbMath1014.68118MaRDI QIDQ4708560

Maria I. Andreou, Dimitris Fotakis, Sotiris E. Nikoletseas, Paul G. Spirakis, Vicky G. Papadopoulou

Publication date: 18 June 2003

Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2420/24200081.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) Approximation algorithms (68W25)

Related Items (1)

On Radiocoloring Hierarchically Specified Planar Graphs: $$\mathcal{PSPACE}$$ -completeness and Approximations

This page was built for publication: