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

Michael Elkin, David Peleg

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-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 languageEnglish
Title of host publicationSIROCCO 8, Proceedings of the 8th International Colloquium on Structural Information and Communication Complexity, Vall de Núria, Girona-Barcelona, Catalonia, Spain, 27-29 June, 2001
EditorsFrancesc Comellas, Josep Fàbrega, Pierre Fraigniaud
PublisherCarleton Scientific
Pages117-132
Number of pages16
Volume8
StatePublished - 2001

Publication series

NameProceedings in Informatics
PublisherCarleton Scientific

Fingerprint

Dive into the research topics of 'The Client-Server 2-Spanner Problem with Applications to Network Design'. Together they form a unique fingerprint.

Cite this