w******T
发帖数: 71 | 1 question 1:
if in a graph, there is no clique, does a constant factor approximate
algorithm
exist?
question 2:
If a graph is planar graph, does a constant factor approximation algorithm
exist? | y***u
发帖数: 101 | 2 经典问题，经典链接：
http://www.nada.kth.se/~viggo/problemlist/compendium.html
【在 w******T 的大作中提到】
: question 1:
: if in a graph, there is no clique, does a constant factor approximate
: algorithm
: exist?
: question 2:
: If a graph is planar graph, does a constant factor approximation algorithm
: exist?
|
|
