scientific article; zbMATH DE number 2038707
From MaRDI portal
Publication:4449172
zbMath1060.90694MaRDI QIDQ4449172
Publication date: 8 February 2004
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2719/27190157.htm
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Approximation algorithms (68W25)
Related Items (5)
Two Approximation Algorithms for ATSP with Strengthened Triangle Inequality ⋮ An improved approximation algorithm for the asymmetric TSP with strengthened triangle inequality ⋮ On the relationship between ATSP and the cycle cover problem ⋮ Approximating the asymmetric \(p\)-center problem in parameterized complete digraphs ⋮ On the hardness of constructing minimal 2-connected spanning subgraphs in complete graphs with sharpened triangle inequality
This page was built for publication:
