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

Authors:
M. Elkin;D. Peleg
Affiliations:
-;-
Venue:
The Client-Server 2-Spanner Problem and Applications to Network Design
Year:
1999

Citing 0
Cited 5

(1 + &egr;&Bgr;)-spanner constructions for general graphs

STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Approximating k-Spanner Problems for k2

Proceedings of the 8th International IPCO Conference on Integer Programming and Combinatorial Optimization
Strong Inapproximability of the Basic k-Spanner Problem

ICALP '00 Proceedings of the 27th International Colloquium on Automata, Languages and Programming
The Hardness of Approximating Spanner Problems

STACS '00 Proceedings of the 17th Annual Symposium on Theoretical Aspects of Computer Science
Approximating k-spanner problems for k 2

Theoretical Computer Science

Quantified Score

Hi-index	0.00

Visualization

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. The paper also studies the bounded-diameter network design (BDND) problem, and establishes a logarithmic approximation ratio for the problem, using the tools developed for the client-server 2-spanner problem.