On the probabilistic behaviour of a heuristic algorithm for maximal Hamiltonian tours (Q924547): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.jda.2006.03.004
+Normal rank
@@ Property / OpenAlex ID @@
+W1993464679
@@ Property / OpenAlex ID: W1993464679 / rank @@
+Normal rank
@@ Property / cites work @@
+The algebraic degree of geometric optimization problems
+Normal rank
@@ Property / cites work @@
+The geometric maximum traveling salesman problem
@@ Property / cites work: The geometric maximum traveling salesman problem / rank @@
+Normal rank
@@ Property / cites work @@
+Q3794956
@@ Property / cites work: Q3794956 / rank @@
+Normal rank
@@ Property / cites work @@
+Fast approximations for sums of distances, clustering and the Fermat-Weber problem
+Normal rank
@@ Property / cites work @@
+Solving a "Hard" problem to approximate an "Easy" one
+Normal rank
@@ Property / cites work @@
+On minimum stars and maximum matchings.
@@ Property / cites work: On minimum stars and maximum matchings. / rank @@
+Normal rank