Approximation algorithms for the TSP with sharpened triangle inequality

Authors:
Hans-Joachim Böckenhauer;Juraj Hromkovič;Ralf Klasing;Sebastian Seibert;Walter Unger
Affiliations:
-;-;-;-;-
Venue:
Information Processing Letters
Year:
2000

Citing 0
Cited 17

Approximation algorithms for time-dependent orienteering

Information Processing Letters
On the Hardness of Constructing Minimal 2-Connected Spanning Subgraphs in Complete Graphs with Sharpened Triangle Inequality

FST TCS '02 Proceedings of the 22nd Conference Kanpur on Foundations of Software Technology and Theoretical Computer Science
On the hardness of constructing minimal 2-connected spanning subgraphs in complete graphs with sharpened triangle inequality

Theoretical Computer Science
An improved approximation algorithm for the asymmetric TSP with strengthened triangle inequality

Journal of Discrete Algorithms
On the relationship between ATSP and the cycle cover problem

Theoretical Computer Science
On k-connectivity problems with sharpened triangle inequality

Journal of Discrete Algorithms
Approximating the Metric TSP in Linear Time

Graph-Theoretic Concepts in Computer Science
Minimum-weight cycle covers and their approximability

Discrete Applied Mathematics
On k-edge-connectivity problems with sharpened triangle inequality

CIAC'03 Proceedings of the 5th Italian conference on Algorithms and complexity
Minimum-weight cycle covers and their approximability

WG'07 Proceedings of the 33rd international conference on Graph-theoretic concepts in computer science
On the hardness of reoptimization

SOFSEM'08 Proceedings of the 34th conference on Current trends in theory and practice of computer science
Deterministic algorithms for multi-criteria TSP

TAMC'11 Proceedings of the 8th annual conference on Theory and applications of models of computation
Approximation algorithms for restricted cycle covers based on cycle decompositions

WG'06 Proceedings of the 32nd international conference on Graph-Theoretic Concepts in Computer Science
Steiner tree reoptimization in graphs with sharpened triangle inequality

Journal of Discrete Algorithms
Approximation algorithms for multi-criteria traveling salesman problems

WAOA'06 Proceedings of the 4th international conference on Approximation and Online Algorithms
The steiner tree reoptimization problem with sharpened triangle inequality

CIAC'10 Proceedings of the 7th international conference on Algorithms and Complexity
Reoptimizing the strengthened metric TSP on multiple edge weight modifications

SEA'12 Proceedings of the 11th international conference on Experimental Algorithms

Quantified Score

Hi-index	0.89

Visualization

Abstract