144 search results - page 5 / 29 » Improved Approximation Algorithms for Metric Max TSP |
ICALP
2005
Springer
14 years 26 days ago
2005
Springer
In the Euclidean group Traveling Salesman Problem (TSP), we are given a set of points P in the plane and a set of m connected regions, each containing at least one point of P. We w...
FOCS
2003
IEEE
14 years 19 days ago
2003
IEEE
A directed multigraph is said to be d-regular if the indegree and outdegree of every vertex is exactly d. By Hall’s theorem one can represent such a multigraph as a combination ...
CAAN
2007
Springer
13 years 11 months ago
2007
Springer
Abstract. Helsgaun has introduced and implemented the lower tolerances (-values) for an approximation of Held-Karp's 1-tree with the purpose to improve the Lin-Kernighan Heuri...
TSP
2008
13 years 7 months ago
2008
Consider a downlink multicast scenario where a base station equipped with multiple antennas wishes to simultaneously broadcast a number of signals to some given groups of users ove...
ESA
2009
Springer
14 years 1 months ago
2009
Springer
In this paper we consider both the maximization variant Max Rep and the minimization variant Min Rep of the famous Label Cover problem, for which, till now, the best approximation ...