Optimal and Approximate Station Placement in Networks (With Applications to Multicasting and Space Efficient Traversals)

Authors:
Clemente Galdi;Christos Kaklamanis;Manuela Montangero;Pino Persiano
Affiliations:
-;-;-;-
Venue:
STACS '01 Proceedings of the 18th Annual Symposium on Theoretical Aspects of Computer Science
Year:
2001

Citing 5
Cited 0

A threshold of ln n for approximating set cover (preliminary version)

STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Approximating shallow-light trees

SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
Complexity and Approximation: Combinatorial Optimization Problems and Their Approximability Properties

Complexity and Approximation: Combinatorial Optimization Problems and Their Approximability Properties
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Approximation algorithms for combinatorial problems

Journal of Computer and System Sciences

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we study the k-station placement problem (k-SP problem, in short) on graphs. This problem has application to efficient multicasting in circuit-switched networks and to space efficient traversals. We show that the problem is NP-complete even for 3-stage graphs and give an approximation algorithm with logarithmic approximation ratio. Moreover we show that the problem can be solved in polynomial time for trees.