scientific article
From MaRDI portal
Publication:3840359
zbMath0910.90259MaRDI QIDQ3840359
Gerhard J. Woeginger, Russell Woodroofe, David S. Johnson, Alexander I. Barvinok
Publication date: 19 April 1999
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Programming involving graphs or networks (90C35) Integer programming (90C10) Abstract computational complexity for mathematical programming problems (90C60)
Related Items
Rank functions of tropical matrices, Elastic geometric shape matching for translations under the Manhattan norm, On the coincidence of the factor and Gondran-Minoux rank functions of matrices over a semiring, The lazy bureaucrat scheduling problem, An efficient algorithm for the single facility location problem with polyhedral norms and disk-shaped demand regions, Asymptotically optimal algorithms for geometric MAX TSP and MAX \(m\)-PSP, The complexity of tropical matrix factorization, Deterministic approximation algorithms for the maximum traveling salesman and maximum triangle packing problems, Detecting matrices of combinatorial rank three, Voronoi polytopes for polyhedral norms on lattices, Improved approximation algorithms for metric MaxTSP, On tropical matrices of small factor rank, Unnamed Item, Approximation of the double traveling salesman problem with multiple stacks, Factoring a band matrix over a semiring, Algorithms – ESA 2004, An Approximation Algorithm for the Maximum Traveling Salesman Problem, Improved deterministic approximation algorithms for max TSP, A \(\frac78\)-approximation algorithm for metric Max TSP, An improved randomized approximation algorithm for Max TSP, An approximation algorithm with performance guarantees for the maximum traveling salesman problem on special matrices, Better approximations for max TSP
