AI Chat AI Image Generator AI Video Text to Speech

Unconstrained Traveling Tournament Problem is APX-complete

12/18/2022

∙

by Salomon Bendayan, et al.

∙

∙

We show that the Unconstrained Traveling Tournament Problem (UTTP) is APX-complete by presenting an L-reduction from a version of metric (1,2)-TSP to UTTP. Keywords: Traveling Tournament Problem, APX-complete, Approximation algorithms, Traveling Salesman Problem

Salomon Bendayan
1 publication
Joseph Cheriyan
7 publications
Kevin K. H. Cheung
8 publications

page 1

page 2

page 3

page 4

research

∙ 05/31/2022

On Maximizing Sums of Non-monotone Submodular and Linear Functions

We study the problem of Regularized Unconstrained Submodular Maximizatio...

0 Benjamin Qi, et al. ∙

research

∙ 09/21/2021

Computational Complexity of Quadratic Unconstrained Binary Optimization

In this paper, we study the computational complexity of the quadratic un...

0 Hirotoshi Yasuoka, et al. ∙

research

∙ 04/28/2021

Verified Approximation Algorithms

We present the first formal verification of approximation algorithms for...

0 Robin Eßmann, et al. ∙

research

∙ 07/21/2018

Metric Violation Distance: Revisited and Extended

Metric data plays an important role in various settings such as metric-b...

0 Chenglin Fan, et al. ∙

research

∙ 04/25/2022

Online Simulation Reduction

We study the problem of simultaneously performing reachability analysis ...

0 Pierre Ganty, et al. ∙

research

∙ 03/21/2018

Similar Elements and Metric Labeling on Complete Graphs

We consider a problem that involves finding similar elements in a collec...

0 Pedro F. Felzenszwalb, et al. ∙

research

∙ 11/23/2020

Neural collapse with unconstrained features

Neural collapse is an emergent phenomenon in deep learning that was rece...

0 Dustin G. Mixon, et al. ∙