Reoptimization of Steiner trees: Changing the terminal set

Theoretical Computer Science

Volumn 410, Issue 36, 2009, Pages 3428-3435

  Böckenhauer, Hans Joachim ^a   Hromkovič, Juraj ^a   Královič, Richard ^a   Mömke, Tobias ^a   Rossmanith, Peter ^b  

^a ETH ZURICH   (Switzerland)

^b RWTH AACHEN UNIVERSITY   (Germany)

Author keywords

Approximation algorithms; Reoptimization; Steiner tree

Indexed keywords

APPROXIMATION RATIOS; NATURAL NUMBER; NP-HARD; OPTIMAL SOLUTIONS; REOPTIMIZATION; STEINER TREE; STEINER TREE PROBLEM; STEINER TREES;

COMPUTATIONAL COMPLEXITY; GRAPH THEORY; OPTIMAL SYSTEMS; SET THEORY;

APPROXIMATION ALGORITHMS;

EID: 67650938907     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2008.04.039     Document Type: Article

References (14)

1. Archetti C., Bertazzi L., and Speranza M.G. Reoptimizing the traveling salesman problem. Networks 42 3 (2003) 154-159
2. Ausiello G., Escoffier B., Monnot J., and Paschos V.T. Reoptimization of minimum and maximum traveling salesman's tours. Proc. of the 10th Scandinavian Workshop on Algorithm Theory (SWAT 2006). LNCS vol. 4059 (2006), Springer 196-207
3. Bern M.W., and Plassmann P.E. The Steiner problem with edge lengths 1 and 2. Information Processing Letters 32 4 (1989) 171-176
4. Böckenhauer H.-J., Forlizzi L., Hromkovič J., Kneis J., Kupke J., Proietti G., and Widmayer P. On the approximability of TSP on local modifications of optimally solved instances. Algorithmic Operations Research 2 2 (2007) 83-93
5. Böckenhauer H.-J., Forlizzi L., Hromkovič J., Kneis J., Kupke J., Proietti G., and Widmayer P. Reusing optimal TSP solutions for locally modified input instances (extended abstract). Proc. of the Fourth IFIP International Conference on Theoretical Computer Science (IFIP TCS 2006) (2006), Springer 251-270
6. Downey R.G., and Fellows M.R. Parameterized Complexity (1999), Springer, New York
7. Dreyfus S.E., and Wagner R.A. The Steiner problem in graphs. Networks 1 (1971/72) 195-207
8. B. Escoffier, M. Milanic, V.T. Paschos, Simple and fast reoptimizations for the Steiner tree problem. DIMACS Techn. Report 2007-01, 2007
9. Garey M.R., and Johnson D.S. Computers and Intractability (1979), W.H. Freeman and Co., San Francisco
10. Hwang F., Richards D., and Winter P. The Steiner Tree Problems. Annals of Discrete Mathematics vol. 53 (1992), North-Holland
11. Mölle D., Richter S., and Rossmanith P. A faster algorithm for the Steiner tree problem. Proc. of the 23rd Annual Symposium on Theoretical Aspects of Computer Science (STACS 2006). LNCS vol. 3884 (2006), Springer 561-570
12. Prömel H.J., and Steger A. The Steiner Tree Problem. Advanced Lectures in Mathematics (2002), Friedr. Vieweg & Sohn, Braunschweig
13. Robins G., and Zelikovsky A. Improved Steiner tree approximation in graphs. Proc. of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2000) (2000), ACM/SIAM 770-779
14. West D.B. Introduction to Graph Theory. 2nd edn (2000), Prentice Hall Inc., Upper Saddle River, NJ