AI Chat AI Image Generator AI Video Text to Speech

A Small Improvement to the Upper Bound on the Integrality Ratio for the s-t Path TSP

04/15/2020

∙

by Xianghui Zhong, et al.

∙

∙

In this paper we investigate the integrality ratio of the standard LP relaxation for the metric s-t path TSP. We make a near-optimal choice for an auxiliary function used in the analysis of Traub and Vygen which leads to an improved upper bound for the integrality ratio of 1.5273.

page 1

page 2

page 3

page 4

research

∙ 08/31/2018

An improved upper bound on the integrality ratio for the s-t-path TSP

We give an improved analysis of the best-of-many Christofides algorithm ...

0 Vera Traub, et al. ∙

research

∙ 08/23/2018

One (more) line on the most Ancient Algorithm in History

We give a new simple and short ("one-line") analysis for the runtime of ...

0 Ilya Volkovich, et al. ∙

research

∙ 06/29/2016

Tighter bounds lead to improved classifiers

The standard approach to supervised classification involves the minimiza...

0 Nicolas Le Roux, et al. ∙

research

∙ 05/07/2019

Forest Representation Learning Guided by Margin Distribution

In this paper, we reformulate the forest representation learning approac...

0 Shen-Huan Lv, et al. ∙

research

∙ 04/11/2022

Nonlocal Effect on a Generalized Ohta-Kawasaki Model

We propose a nonlocal Ohta-Kawasaki model to study the nonlocal effect o...

0 Wangbo Luo, et al. ∙

research

∙ 05/05/2021

The ratio of the numbers of odd and even cycles in outerplanar graphs

In this paper, we investigate the ratio of the numbers of odd and even c...

0 Akihiro Higashitani, et al. ∙

research

∙ 09/21/2020

Improving on Best-of-Many-Christofides for T-tours

The T-tour problem is a natural generalization of TSP and Path TSP. Give...

0 Vera Traub, et al. ∙