On Rajagopalan and Vazirani's 3/2-approximation bound for the Iterated 1-Steiner heuristic

Information Processing Letters

Volumn 86, Issue 6, 2003, Pages 335-338

  Rizzi, Romeo ^a,b  

^a AARHUS UNIVERSITY   (Denmark)

^b UNIVERSITY OF TRENTO   (Italy)

Author keywords

Approximation algorithms; Bit scaling; Iterated 1 Steiner heuristic; Local search; Steiner tree

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; HEURISTIC METHODS; ITERATIVE METHODS; TREES (MATHEMATICS);

BIT SCALING;

COMPUTER SCIENCE;

EID: 0038286379     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0020-0190(03)00210-2     Document Type: Article

References (5)

1. Kahng A.B., Robins G. A new class of iterative Steiner tree heuristics with good performance. IEEE Trans. Computer-Aided Design. 11:(7):1992;893-902.
2. Kahng A.B., Robins G. On Optimal Interconnections for VLSI. 1995;Kluwer Publishers, Dordrecht.
3. Rajagopalan S., Vazirani V.V. On the bidirected cut relaxation for the metric Steiner tree problem. SODA'99. 1999;742-751.
4. Robins G., Zelikovsky A. Improved Steiner tree approximation in graphs. SODA'00. 2000.
5. R. Rizzi, On the Steiner tree 3 2 -approximation for quasi-bipartite graphs, BRICS Report Series, RS-99-39, November 1999.