Sciweavers

3875 search results - page 1 / 775
» Approximation Algorithms for the Max-coloring Problem
Sort
View
ICALP
2011
Springer
14 years 1 months ago
Clique Clustering Yields a PTAS for max-Coloring Interval Graphs
We are given an interval graph G = (V, E) where each interval I ∈ V has a weight wI ∈ R+. The goal is to color the intervals V with an arbitrary number of color classes C1, C2...
Tim Nonner
73
Voted
WEA
2004
Springer
117views Algorithms» more  WEA 2004»
15 years 2 months ago
Approximating Interval Coloring and Max-Coloring in Chordal Graphs
Sriram V. Pemmaraju, Sriram Penumatcha, Rajiv Rama...
103
Voted
COCO
2010
Springer
180views Algorithms» more  COCO 2010»
15 years 1 months ago
Completely Inapproximable Monotone and Antimonotone Parameterized Problems
We prove that weighted monotone/antimonotone circuit satisfiability has no fixed-parameter tractable approximation algorithm with any approximation ratio function ρ, unless FPT...
Dániel Marx
76
Voted
MOR
2006
90views more  MOR 2006»
14 years 9 months ago
Approximation Algorithms for the Job Interval Selection Problem and Related Scheduling Problems
Julia Chuzhoy, Rafail Ostrovsky, Yuval Rabani