Zobrazeno 1 - 10
of 3 433
pro vyhledávání: '"WILLIAMSON, DAVID"'
One of the most famous conjectures in combinatorial optimization is the four-thirds conjecture, which states that the integrality gap of the subtour LP relaxation of the TSP is equal to $\frac43$. For 40 years, the best known upper bound was 1.5, due
Externí odkaz:
http://arxiv.org/abs/2311.01950
This paper revisits the 2-approximation algorithm for $k$-MST presented by Garg in light of a recent paper of Paul et al.. In the $k$-MST problem, the goal is to return a tree spanning $k$ vertices of minimum total edge cost. Paul et al. extend Garg'
Externí odkaz:
http://arxiv.org/abs/2306.01867