575 search results - page 28 / 115 » A Note on Karr's Algorithm |
99
Voted
CCCG
2010
15 years 17 days ago
2010
In the Euclidean TSP with neighborhoods (TSPN), we are given a collection of n regions (neighborhoods) and we seek a shortest tour that visits each region. In the path variant, we...
76
Voted
CCCG
2007
15 years 17 days ago
2007
Let P be a set of n points in the plane. A connecting line of P is a line that passes through at least two of its points. A connecting line is called ordinary if it is incident on...
72
Voted
IADIS
2003
15 years 15 days ago
2003
The key features of the principal interior routing protocols for large systems are considered and compared, and the major weaknesses of the open standards noted. A proposal is giv...
61
Voted
SODA
2000
ACM
15 years 14 days ago
2000
ACM
In this note we describe a general technique for making treestructured dynamic dictionaries adapt to be competitive with the most efficient implementation, by using potential ener...
EOR
2008
14 years 11 months ago
2008
For the p-median problem we study complexity of finding a local minimum in the worst and the average cases. We introduce several neighborhoods and show that the corresponding loca...