Andreae, Thomas; Bandelt, Hans-Jürgen Performance guarantees for approximation algorithms depending on parametrized triangle inequalities. (English) Zbl 0832.90089 SIAM J. Discrete Math. 8, No. 1, 1-16 (1995). Cited in 3 ReviewsCited in 24 Documents MSC: 90C27 Combinatorial optimization 90C35 Programming involving graphs or networks 68R99 Discrete mathematics in relation to computer science Keywords:performance guarantee; parametrized triangle inequality; minimum Steiner tree; anticlustering; traveling salesman; worst-case analyses of heuristics; approximation algorithms PDF BibTeX XML Cite \textit{T. Andreae} and \textit{H.-J. Bandelt}, SIAM J. Discrete Math. 8, No. 1, 1--16 (1995; Zbl 0832.90089) Full Text: DOI OpenURL