@inproceedings{e96932f466a0462db10215c9a7e82bc4,
title = "Graph products and chromatic numbers",
abstract = "The problem of computing the chromatic number of a graph is considered. No known approximation algorithm can guarantee a better than O(n0.4) coloring on a three-chromatic graph with n vertices. Evidence is provided that it is inherently impossible to achieve a better than nε ratio in polynomial time by showing that 'breaking the nε barrier' will automatically lead to vastly better polynomial-time approximation algorithms that achieve ratios closer to log n.",
author = "Nati Linial and Umesh Vazirani",
year = "1989",
doi = "10.1109/sfcs.1989.63466",
language = "אנגלית",
isbn = "0818619821",
series = "Annual Symposium on Foundations of Computer Science (Proceedings)",
publisher = "Publ by IEEE",
pages = "124--128",
booktitle = "Annual Symposium on Foundations of Computer Science (Proceedings)",
note = "30th Annual Symposium on Foundations of Computer Science ; Conference date: 30-10-1989 Through 01-11-1989",
}