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

08/31/2018
by   Vera Traub, et al.
0

We give an improved analysis of the best-of-many Christofides algorithm with lonely edge deletion, which was proposed by Sebő and van Zuylen [2016]. This implies an improved upper bound on the integrality ratio of the standard LP relaxation for the s-t-path TSP.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
04/15/2020

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

In this paper we investigate the integrality ratio of the standard LP re...
research
06/02/2021

Improved Spanning on Theta-5

We show an upper bound of sin(3π/10) /sin(2π/5)-sin(3π/10) <5.70 ...
research
06/29/2016

Tighter bounds lead to improved classifiers

The standard approach to supervised classification involves the minimiza...
research
08/20/2018

The asymmetric traveling salesman path LP has constant integrality ratio

We show that the classical LP relaxation of the asymmetric traveling sal...
research
09/30/2019

Analysis of error dependencies on NewHope

Among many submissions to the NIST post-quantum cryptography (PQC) proje...
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...
research
05/11/2022

Robustness Guarantees for Credal Bayesian Networks via Constraint Relaxation over Probabilistic Circuits

In many domains, worst-case guarantees on the performance (e.g., predict...

Please sign up or login with your details

Forgot password? Click here to reset