Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

14

WEA
2004
Springer

favoriteEmaildiscussreport

117views Algorithms» more WEA 2004»

Approximating Interval Coloring and Max-Coloring in Chordal Graphs

13 years 9 months ago

Approximating Interval Coloring and Max-Coloring in Chordal Graphs

Download www.mpi-inf.mpg.de

Sriram V. Pemmaraju, Sriram Penumatcha, Rajiv Rama

Real-time Traffic

Algorithms | WEA 2004 |

claim paper

Related Content

» Clique Clustering Yields a PTAS for maxColoring Interval Graphs

» Approximations for Aligned Coloring and Spillage Minimization in Interval and Chordal Grap...

» Optimization problems in multiple subtree graphs

» Hardness and approximation of minimum distortion embeddings

» Approximating the minimum clique cover and other hard problems in subtree filament graphs

» Robust cost colorings

» Finding Independent Sets in Unions of Perfect Graphs

» Approximation Algorithms for the Maxcoloring Problem

» Minimum Entropy Coloring

Post Info
More Details (n/a)

Added	02 Jul 2010
Updated	02 Jul 2010
Type	Conference
Year	2004
Where	WEA
Authors	Sriram V. Pemmaraju, Sriram Penumatcha, Rajiv Raman

Comments (0)