Skip to main content

All Questions

Filter by
Sorted by
Tagged with
1 vote
1 answer
130 views

Computational Geometric Aspects of Greedy Tour Expansion

Has the following problem already been investigated from the Computational Geometry point of view and what are the results regarding worst case complexity? Given a finite set $\mathcal{P}...
Manfred Weis's user avatar
  • 13.2k
1 vote
0 answers
27 views

Complexity of tour-expansion heuristic for the planar Euclidean TSP

This is a followup question to this one: Computational Geometric Aspects of Greedy Tour Expansion. Assume that the candidate point, whose insertion into current incurs the least tour-length increase, ...
Manfred Weis's user avatar
  • 13.2k