Browse Dept. of Computer Science by Author "Vakilian, Ali"

  • 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)
  • Vakilian, Ali (2013-08-22)
    We consider node-weighted network design problems, in particular the survivable network design problem SNDP and its prize-collecting version PC-SNDP. The input consists of a node-weighted undirected graph $G=(V,E)$ ...

    application/pdf

    application/pdfPDF (614kB)