### Abstract

The problem of finding a minimum cost subset of missing links in a communication network was considered, such that adding these links to the network makes every pair of points within distance at most d from each other. A novel linear programming based approach was used to obtain an O(log n log d) approximation algorithm for the case of uniform link lengths and costs. The Ω(log n) hardness was also extended to d∈{2, 3}. On the other hand, if link costs can vary, it was shown that the problem is Ω(2^{log(1-ε)n})-hard for d≥3.

Original language | English (US) |
---|---|

Title of host publication | Conference Proceedings of the Annual ACM Symposium on Theory of Computing |

Publisher | ACM |

Pages | 750-759 |

Number of pages | 10 |

State | Published - 1999 |

Event | Proceedings of the 1999 31st Annual ACM Symposium on Theory of Computing - FCRC '99 - Atlanta, GA, USA Duration: May 1 1999 → May 4 1999 |

### Other

Other | Proceedings of the 1999 31st Annual ACM Symposium on Theory of Computing - FCRC '99 |
---|---|

City | Atlanta, GA, USA |

Period | 5/1/99 → 5/4/99 |

### Fingerprint

### ASJC Scopus subject areas

- Software

### Cite this

*Conference Proceedings of the Annual ACM Symposium on Theory of Computing*(pp. 750-759). ACM.

**Designing networks with bounded pairwise distance.** / Dodis, Yevgeniy; Khanna, Sanjeev.

Research output: Chapter in Book/Report/Conference proceeding › Chapter

*Conference Proceedings of the Annual ACM Symposium on Theory of Computing.*ACM, pp. 750-759, Proceedings of the 1999 31st Annual ACM Symposium on Theory of Computing - FCRC '99, Atlanta, GA, USA, 5/1/99.

}

TY - CHAP

T1 - Designing networks with bounded pairwise distance

AU - Dodis, Yevgeniy

AU - Khanna, Sanjeev

PY - 1999

Y1 - 1999

N2 - The problem of finding a minimum cost subset of missing links in a communication network was considered, such that adding these links to the network makes every pair of points within distance at most d from each other. A novel linear programming based approach was used to obtain an O(log n log d) approximation algorithm for the case of uniform link lengths and costs. The Ω(log n) hardness was also extended to d∈{2, 3}. On the other hand, if link costs can vary, it was shown that the problem is Ω(2log(1-ε)n)-hard for d≥3.

AB - The problem of finding a minimum cost subset of missing links in a communication network was considered, such that adding these links to the network makes every pair of points within distance at most d from each other. A novel linear programming based approach was used to obtain an O(log n log d) approximation algorithm for the case of uniform link lengths and costs. The Ω(log n) hardness was also extended to d∈{2, 3}. On the other hand, if link costs can vary, it was shown that the problem is Ω(2log(1-ε)n)-hard for d≥3.

UR - http://www.scopus.com/inward/record.url?scp=0032663833&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0032663833&partnerID=8YFLogxK

M3 - Chapter

AN - SCOPUS:0032663833

SP - 750

EP - 759

BT - Conference Proceedings of the Annual ACM Symposium on Theory of Computing

PB - ACM

ER -