Karp's patching algorithm on dense digraphs

06/18/2020
by   Alan Frieze, et al.
0

We consider the following question. We are given a dense digraph D with minimum in- and out-degree at least α n, where α>1/2 is a constant. The edges of D are given edge costs C(e),e∈ E(D), where C(e) is an independent copy of the uniform [0,1] random variable U. Let C(i,j),i,j∈[n] be the associated n× n cost matrix where C(i,j)=∞ if (i,j)∉ E(D). We show that w.h.p. the patching algorithm of Karp finds a tour for the asymmetric traveling salesperson problem that is asymptotically equal to that of the associated assignment problem. Karp's algorithm runs in polynomial time.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
09/07/2020

Probabilistic analysis of algorithms for cost constrained minimum weighted combinatorial objects

We consider cost constrained versions of the minimum spanning tree probl...
research
08/05/2023

On the expected efficiency of branch and bound for the asymmetric TSP

Let the costs C(i,j) for an instance of the asymmetric traveling salespe...
research
11/16/2020

Efficient polynomial-time approximation scheme for the genus of dense graphs

The main results of this paper provide an Efficient Polynomial-Time Appr...
research
10/07/2017

Combinatorial Miller-Hagberg Algorithm for Randomization of Dense Networks

We propose a slightly revised Miller-Hagberg (MH) algorithm that efficie...
research
07/08/2019

A randomly weighted minimum arborescence with a random cost constraint

We study the minimum spanning arborescence problem on the complete digra...
research
04/19/2023

Uniform Generation of Temporal Graphs with Given Degrees

Uniform sampling from the set 𝒢(𝐝) of graphs with a given degree-sequenc...
research
02/13/2023

Detection-Recovery Gap for Planted Dense Cycles

Planted dense cycles are a type of latent structure that appears in many...

Please sign up or login with your details

Forgot password? Click here to reset