Improved hardness results for approximating the chromatic number

Annual Symposium on Foundations of Computer Science - Proceedings

Volumn , Issue , 1995, Pages 414-421

  Furer, Martin ^a  

^a PENNSYLVANIA STATE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; GRAPH THEORY; OPTIMIZATION; RANDOM PROCESSES;

CHROMATIC NUMBER; POLYNOMIAL TIME ALGORITHM; RANDOMIZED TWISTING METHOD;

COMPUTATIONAL COMPLEXITY;

EID: 0029534490     PISSN: 02725428     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (12)