Skip to main content

All Questions

Filter by
Sorted by
Tagged with
3 votes
0 answers
147 views

Understanding why $\frac{\phi^5}{2}$ solves this 3D optimization problem, where $\phi$ is the golden ratio

I would like to understand the deep meaning of a solution which arises from an optimization problem discussed in a paper of mine since it can be simply stated as $\frac{\phi^5}{2}$, where $\phi := \...
Marco Ripà's user avatar
  • 1,451
1 vote
0 answers
67 views

Conjecture on the increasing efficiency of the shortest minimum-link polygonal chains covering any grids of the form $\{0,1,2\}^k$ as $k$ grows

From the well-known Nine dots problem, we know that we need a polygonal chain with at least $4$ edges to connect the $9$ points of the planar grid $G_{3,2}:=\{\{0, 1, 2\} \times \{0, 1, 2\}\} \subset \...
Marco Ripà's user avatar
  • 1,451
8 votes
1 answer
567 views

Joining the $2^k$ points of $\{0,1\}^k$ with the shortest tree

Let $k$ be a given positive integer, and then consider the unit hypercube $\{0, 1\}^k \subset \mathbb{R}^k$ (i.e., a $k$-dimensional "cube" in the well-known Euclidean space). We need to ...
Marco Ripà's user avatar
  • 1,451
7 votes
1 answer
171 views

Metric TSP with integer edge cost

Given a metric TSP with integer edge cost upper-bounded by a constant $C_{\max}$, can we find an poly-time algorithm solving this TSP instance?
lchen's user avatar
  • 367
4 votes
1 answer
1k views

Algorithm for the shortest path through all the points of a 2D cloud

I have an array of points with their coordinates X and Y. Each point represents a bus stop. I need to sort the points in a sequence by giving them sequence numbers, so that the path from the first to ...
Julien's user avatar
  • 61