Zola Donovan

We don’t have enough information about this author to calculate their statistics. If you think this is an error let us know.
Learn More
—We consider the problem of clustering the nodes of directed acyclic graphs when the repli-cation of logic is not allowed. We show that the problem is NP-hard even when the vertices of the DAG are unweighted and the cluster capacity is 2. Moreover, when the vertices of the DAG are weighted, the problem does not admit a (2 − ǫ)-approximation algorithm for(More)
  • 1