scientific article; zbMATH DE number 2038707
From MaRDI portal
Publication:4449172
Recommendations
- An improved approximation algorithm for the asymmetric TSP with strengthened triangle inequality
- An improved approximation algorithm for the ATSP with parameterized triangle inequality
- Two Approximation Algorithms for ATSP with Strengthened Triangle Inequality
- scientific article; zbMATH DE number 2086388
- 35/44-approximation for asymmetric maximum TSP with triangle inequality
Cited in
(16)- Approximating the asymmetric \(p\)-center problem in parameterized complete digraphs
- Performance guarantees for the TSP with a parameterized triangle inequality
- Two Approximation Algorithms for ATSP with Strengthened Triangle Inequality
- An improved approximation algorithm for the ATSP with parameterized triangle inequality
- 35/44-Approximation for Asymmetric Maximum TSP with Triangle Inequality
- scientific article; zbMATH DE number 2079394 (Why is no real title available?)
- scientific article; zbMATH DE number 2086388 (Why is no real title available?)
- A new approximation algorithm for the asymmetric TSP with triangle inequality
- STACS 2004
- 35/44-approximation for asymmetric maximum TSP with triangle inequality
- Parameterized approximations for the minimum diameter vertex-weighted Steiner tree problem in graphs with parameterized weights
- On the maximum TSP with -parameterized triangle inequality
- On the hardness of constructing minimal 2-connected spanning subgraphs in complete graphs with sharpened triangle inequality
- An improved approximation algorithm for the asymmetric TSP with strengthened triangle inequality
- On the relationship between ATSP and the cycle cover problem
- An improved approximation algorithm for the maximum TSP
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4449172)
