#### Filter Results:

- Full text PDF available (13)

#### Publication Year

2008

2017

- This year (1)
- Last five years (15)

#### Publication Type

#### Co-author

#### Publication Venue

#### Data Set Used

#### Key Phrases

Learn More

- Chandra Chekuri, Alina Ene, Ali Vakilian
- APPROX-RANDOM
- 2012

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) and integral connectivity requirements r(st) for each pair of nodes st. The goal is to find a minimum node-weighted subgraph H of G such… (More)

- Erik D. Demaine, Piotr Indyk, Sepideh Mahabadi, Ali Vakilian
- DISC
- 2014

We develop the first streaming algorithm and the first two-party communication protocol that uses a constant number of passes/rounds and sublin-ear space/communication for logarithmic approximation to the classic Set Cover problem. Specifically, for n elements and m sets, our algorithm/protocol achieves a space bound of O(m · n δ log 2 n log m) using O(4… (More)

- Sariel Har-Peled, Piotr Indyk, Sepideh Mahabadi, Ali Vakilian
- PODS
- 2016

We consider the classic Set Cover problem in the data stream model. For n elements and m sets (m ≥ n) we give a O(1/δ)-pass algorithm with a strongly sub-linear ~O(mn<sup>δ</sup>) space and logarithmic approximation factor. This yields a significant improvement over the earlier algorithm of Demaine et al. [10] that uses exponentially larger… (More)

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) and integral connectivity requirements r(st) for each pair of nodes st. The goal is to find a minimum node-weighted subgraph H of G such… (More)

- Alina Ene, Ali Vakilian
- STOC
- 2014

We consider <i>degree bounded</i> network design problems with element and vertex connectivity requirements. In the degree bounded Survivable Network Design (SNDP) problem, the input is an undirected graph <i>G</i> = (<i>V, E</i>) with weights <i>w</i>(<i>e</i>) on the edges and degree bounds <i>b</i>(<i>v</i>) on the vertices, and connectivity requirements… (More)

- Chandra Chekuri, Alina Ene, Ali Vakilian
- ICALP
- 2012

We consider node-weighted network design in planar and minor-closed families of graphs. In particular we focus on the edge-connectivity survivable network design problem (EC-SNDP). The input consists of a node-weighted undi-rected graph G = (V, E) and integral connectivity requirements r(uv) for each pair of nodes uv. The goal is to find a minimum… (More)

- Arash Termehchy, Ali Vakilian, Yodsawalai Chodpathumwan, Marianne Winslett
- SIGMOD Conference
- 2014

It is well established that extracting and annotating occurrences of entities in a collection of unstructured text documents with their concepts improve the effectiveness of answering queries over the collection. However, it is very resource intensive to create and maintain large annotated collections. Since the available resources of an enterprise are… (More)

- Alina Ene, Nitish Korula, Ali Vakilian
- ArXiv
- 2013

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 problem asks for a partition of the nodes into connected dominating sets. The connected domatic number of a graph is the size of a… (More)

It is known that annotating named entities in unstructured and semi-structured data sets by their concepts improves the effectiveness of answering queries over these data sets. Ideally, one would like to annotate entities of all concepts in a given domain in a data set, however, it takes substantial time and computational resources to do so over a large… (More)