scientific article; zbMATH DE number 1754632
From MaRDI portal
zbMath0986.05046MaRDI QIDQ4535060
Stéphane Pérennes, Christos Kaklamanis, Ioannis Caragiannis, Herve Rivano, Afonso G. Ferreira
Publication date: 12 June 2002
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2076/20760732
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Communication networks in operations research (90B18) Network design and communication in computer systems (68M10) Coloring of graphs and hypergraphs (05C15)
Related Items
Faster and simpler approximation algorithms for mixed packing and covering problems, Approximate strong separation with application in fractional graph coloring and preemptive scheduling., Path problems in generalized stars, complete graphs, and brick wall graphs, An approximation algorithm for the general max-min resource sharing problem, Minimizing maximum fiber requirement in optical networks
