Designing networks with bounded pairwise distance

Yevgeniy Dodis, Sanjeev Khanna

Research output: Chapter in Book/Report/Conference proceedingChapter

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 Ω(2log(1-ε)n)-hard for d≥3.

Original languageEnglish (US)
Title of host publicationConference Proceedings of the Annual ACM Symposium on Theory of Computing
PublisherACM
Pages750-759
Number of pages10
StatePublished - 1999
EventProceedings of the 1999 31st Annual ACM Symposium on Theory of Computing - FCRC '99 - Atlanta, GA, USA
Duration: May 1 1999May 4 1999

Other

OtherProceedings of the 1999 31st Annual ACM Symposium on Theory of Computing - FCRC '99
CityAtlanta, GA, USA
Period5/1/995/4/99

Fingerprint

Costs
Approximation algorithms
Linear programming
Telecommunication networks
Hardness

ASJC Scopus subject areas

  • Software

Cite this

Dodis, Y., & Khanna, S. (1999). Designing networks with bounded pairwise distance. In 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.

Conference Proceedings of the Annual ACM Symposium on Theory of Computing. ACM, 1999. p. 750-759.

Research output: Chapter in Book/Report/Conference proceedingChapter

Dodis, Y & Khanna, S 1999, Designing networks with bounded pairwise distance. in 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.
Dodis Y, Khanna S. Designing networks with bounded pairwise distance. In Conference Proceedings of the Annual ACM Symposium on Theory of Computing. ACM. 1999. p. 750-759
Dodis, Yevgeniy ; Khanna, Sanjeev. / Designing networks with bounded pairwise distance. Conference Proceedings of the Annual ACM Symposium on Theory of Computing. ACM, 1999. pp. 750-759
@inbook{8196bb76a0d4469c91a30af21450d61a,
title = "Designing networks with bounded pairwise distance",
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 Ω(2log(1-ε)n)-hard for d≥3.",
author = "Yevgeniy Dodis and Sanjeev Khanna",
year = "1999",
language = "English (US)",
pages = "750--759",
booktitle = "Conference Proceedings of the Annual ACM Symposium on Theory of Computing",
publisher = "ACM",

}

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 -