Sciweavers

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

45

ISAAC
2010
Springer

favoriteEmaildiscussreport

265views Algorithms» more ISAAC 2010»

On the Approximability of the Maximum Interval Constrained Coloring Problem

13 years 8 months ago

On the Approximability of the Maximum Interval Constrained Coloring Problem

Download www.mpi-inf.mpg.de

Stefan Canzar, Khaled M. Elbassioni, Amr Elmasry,

Real-time Traffic

Algorithms | ISAAC 2010 |

claim paper

Related Content

» The Interval Constrained 3Coloring Problem

» Online Interval Coloring with Packing Constraints

» Deconstructing Intractability A Case Study for Interval Constrained Coloring

» RentorBuy Scheduling and Cost Coloring Problems

» Latency Constrained Aggregation in Chain Networks Admits a PTAS

» Optimization problems in multiple subtree graphs

» Deconstructing intractability A multivariate complexity analysis of interval constrained ...

» Approximating the 2Interval Pattern Problem

» On Complexity and Approximability of the Labeled MaximumPerfect Matching Problems

Post Info
More Details (n/a)

Added	13 Feb 2011
Updated	13 Feb 2011
Type	Journal
Year	2010
Where	ISAAC
Authors	Stefan Canzar, Khaled M. Elbassioni, Amr Elmasry, Rajiv Raman

Comments (0)