The Client-Server 2-Spanner Problem with Applications to Network Design

Michael Elkin; David Peleg

The Client-Server 2-Spanner Problem with Applications to Network Design

Michael Elkin
, David Peleg

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

Abstract

This paper studies the client-server version of the 2-spanner problem. This is a natural generalization of the sparse 2-spanner problem that turns out to be useful for certain network design problems. The paper presents a logarithmic ratio approximation algorithm for this problem. The algorithm and the analysis are extended to the directed client-server 2-spanner problem and to the client-server augmentation 2-spanner problem, establishing a
logarithmic approximation ratio for these problems too.

Original language	English
Title of host publication	SIROCCO 2001
Subtitle of host publication	Proceedings of the 8th International Colloquium on Structural Information and Communication Complexity, Vall de Núria, Girona-Barcelona, Catalonia, Spain, 27-29 June, 2001
Editors	Francesc Comellas, Josep Fàbrega, Pierre Fraigniaud
Place of Publication	Girona-Barcelona, Catalonia, Spain
Publisher	Carleton Scientific
Pages	117-132
Number of pages	16
Volume	8
ISBN (Electronic)	1894145100
State	Published - 2001

Publication series

Name	Proceedings in Informatics
Publisher	Carleton Scientific

Cite this

Elkin, M., & Peleg, D. (2001). The Client-Server 2-Spanner Problem with Applications to Network Design. In F. Comellas, J. Fàbrega, & P. Fraigniaud (Eds.), SIROCCO 2001 : Proceedings of the 8th International Colloquium on Structural Information and Communication Complexity, Vall de Núria, Girona-Barcelona, Catalonia, Spain, 27-29 June, 2001 (Vol. 8, pp. 117-132). (Proceedings in Informatics). Carleton Scientific.

Elkin, Michael ; Peleg, David. / The Client-Server 2-Spanner Problem with Applications to Network Design. SIROCCO 2001 : Proceedings of the 8th International Colloquium on Structural Information and Communication Complexity, Vall de Núria, Girona-Barcelona, Catalonia, Spain, 27-29 June, 2001. editor / Francesc Comellas ; Josep Fàbrega ; Pierre Fraigniaud. Vol. 8 Girona-Barcelona, Catalonia, Spain : Carleton Scientific, 2001. pp. 117-132 (Proceedings in Informatics).

@inproceedings{11f19ef1cd3440629baf12472c2ee808,

title = "The Client-Server 2-Spanner Problem with Applications to Network Design",

abstract = "This paper studies the client-server version of the 2-spanner problem. This is a natural generalization of the sparse 2-spanner problem that turns out to be useful for certain network design problems. The paper presents a logarithmic ratio approximation algorithm for this problem. The algorithm and the analysis are extended to the directed client-server 2-spanner problem and to the client-server augmentation 2-spanner problem, establishing a logarithmic approximation ratio for these problems too.",

author = "Michael Elkin and David Peleg",

year = "2001",

language = "English",

volume = "8",

series = "Proceedings in Informatics",

publisher = "Carleton Scientific",

pages = "117--132",

editor = "Francesc Comellas and Josep F{\`a}brega and Pierre Fraigniaud",

booktitle = "SIROCCO 2001",

}

Elkin, M & Peleg, D 2001, The Client-Server 2-Spanner Problem with Applications to Network Design. in F Comellas, J Fàbrega & P Fraigniaud (eds), SIROCCO 2001 : Proceedings of the 8th International Colloquium on Structural Information and Communication Complexity, Vall de Núria, Girona-Barcelona, Catalonia, Spain, 27-29 June, 2001. vol. 8, Proceedings in Informatics, Carleton Scientific, Girona-Barcelona, Catalonia, Spain, pp. 117-132.

The Client-Server 2-Spanner Problem with Applications to Network Design. / Elkin, Michael; Peleg, David.
SIROCCO 2001 : Proceedings of the 8th International Colloquium on Structural Information and Communication Complexity, Vall de Núria, Girona-Barcelona, Catalonia, Spain, 27-29 June, 2001. ed. / Francesc Comellas; Josep Fàbrega; Pierre Fraigniaud. Vol. 8 Girona-Barcelona, Catalonia, Spain: Carleton Scientific, 2001. p. 117-132 (Proceedings in Informatics).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - The Client-Server 2-Spanner Problem with Applications to Network Design

AU - Elkin, Michael

AU - Peleg, David

PY - 2001

Y1 - 2001

N2 - This paper studies the client-server version of the 2-spanner problem. This is a natural generalization of the sparse 2-spanner problem that turns out to be useful for certain network design problems. The paper presents a logarithmic ratio approximation algorithm for this problem. The algorithm and the analysis are extended to the directed client-server 2-spanner problem and to the client-server augmentation 2-spanner problem, establishing a logarithmic approximation ratio for these problems too.

AB - This paper studies the client-server version of the 2-spanner problem. This is a natural generalization of the sparse 2-spanner problem that turns out to be useful for certain network design problems. The paper presents a logarithmic ratio approximation algorithm for this problem. The algorithm and the analysis are extended to the directed client-server 2-spanner problem and to the client-server augmentation 2-spanner problem, establishing a logarithmic approximation ratio for these problems too.

M3 - Conference contribution

VL - 8

T3 - Proceedings in Informatics

SP - 117

EP - 132

BT - SIROCCO 2001

A2 - Comellas, Francesc

A2 - Fàbrega, Josep

A2 - Fraigniaud, Pierre

PB - Carleton Scientific

CY - Girona-Barcelona, Catalonia, Spain

ER -

Elkin M, Peleg D. The Client-Server 2-Spanner Problem with Applications to Network Design. In Comellas F, Fàbrega J, Fraigniaud P, editors, SIROCCO 2001 : Proceedings of the 8th International Colloquium on Structural Information and Communication Complexity, Vall de Núria, Girona-Barcelona, Catalonia, Spain, 27-29 June, 2001. Vol. 8. Girona-Barcelona, Catalonia, Spain: Carleton Scientific. 2001. p. 117-132. (Proceedings in Informatics).

The Client-Server 2-Spanner Problem with Applications to Network Design

Abstract

Publication series

Fingerprint

Cite this