Browse Dept. of Computer Science by Author "Ene, Alina"

  • Ene, Alina (2014-01-16)
    In this thesis, we consider combinatorial optimization problems involving submodular functions and graphs. The problems we study are NP-hard and therefore, assuming that P =/= NP, there do not exist polynomial-time ...

    application/pdf

    application/pdfPDF (1MB)
  • Ene, Alina; Korula, Nitish J.; Vakilian, Ali (arXiv, 2013-07)
    A set of vertices in a graph is a dominating set if every vertex outside the set has a neighbor in the set. A dominating set is connected if the subgraph induced by its vertices is connected. The connected domatic partition ...

    application/pdf

    application/pdfPDF (162kB)