Performance Guarantees for Approximation Algorithms Depending on Parametrized Triangle Inequalities
From MaRDI portal
Recommendations
- Performance guarantees for the TSP with a parameterized triangle inequality
- On the traveling salesman problem restricted to inputs satisfying a relaxed triangle inequality
- An improved approximation algorithm for the ATSP with parameterized triangle inequality
- An improved approximation algorithm for the maximum TSP
Cited in
(34)- On k-connectivity problems with sharpened triangle inequality
- Triadic distance models: axiomatization and least squares representation
- On approximability of linear ordering and related NP-optimization problems on graphs.
- Towards the notion of stability of approximation for hard optimization tasks and the traveling salesman problem.
- Approximability and inapproximability of the star p-hub center problem with parameterized triangle inequality
- Minimum transversals of maximum matchings as approximate solutions to the bisection problem
- A 4-approximation algorithm for the TSP-path satisfying a biased triangle inequality
- On the approximability of the single allocation \(p\)-hub center problem with parameterized triangle inequality
- Approximation algorithms for the \(p\)-hub center routing problem in parameterized metric graphs
- An improved approximation algorithm for the traveling salesman problem with relaxed triangle inequality
- The minimum-area spanning tree problem
- On the traveling salesman problem restricted to inputs satisfying a relaxed triangle inequality
- Performance guarantees for the TSP with a parameterized triangle inequality
- Approximation algorithms for the TSP with sharpened triangle inequality
- Improved approximations for hard optimization problems via problem instance classification
- Constant factor approximation algorithm for TSP satisfying a biased triangle inequality
- Autour de nouvelles notions pour l'analyse des algorithmes d'approximation : de la structure de NPO à la structure des instances
- Approximation Algorithms for the Traveling Salesman Problem with Range Condition
- Improved Lower Bounds on the Approximability of the Traveling Salesman Problem
- On the two largest distance eigenvalues of graph powers
- Improved approximations for ordered TSP on near-metric graphs
- Approximation Guarantees for Max Sum and Max Min Facility Dispersion with Parameterised Triangle Inequality and Applications in Result Diversification
- On the Complexity of the Star p-hub Center Problem with Parameterized Triangle Inequality
- Fixed parameter tractability of a biconnected bottleneck Steiner network problem
- Stability of Reapproximation Algorithms for the $$\beta $$-Metric Traveling Salesman (Path) Problem
- A Modern View on Stability of Approximation
- On the general position number of the k -th power graphs
- Algebraic bounds for the independence and chromatic number of graph powers
- On the hardness and approximation of the densest k-subgraph problem in parameterized metric graphs
- An FPT factor-11 approximation algorithm for TSP
- Finding minimum cost data collection tree with aggregation
- 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
This page was built for publication: Performance Guarantees for Approximation Algorithms Depending on Parametrized Triangle Inequalities
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4764340)
