1,484 research outputs found
A domination algorithm for -instances of the travelling salesman problem
We present an approximation algorithm for -instances of the
travelling salesman problem which performs well with respect to combinatorial
dominance. More precisely, we give a polynomial-time algorithm which has
domination ratio . In other words, given a
-edge-weighting of the complete graph on vertices, our
algorithm outputs a Hamilton cycle of with the following property:
the proportion of Hamilton cycles of whose weight is smaller than that of
is at most . Our analysis is based on a martingale approach.
Previously, the best result in this direction was a polynomial-time algorithm
with domination ratio for arbitrary edge-weights. We also prove a
hardness result showing that, if the Exponential Time Hypothesis holds, there
exists a constant such that cannot be replaced by in the result above.Comment: 29 pages (final version to appear in Random Structures and
Algorithms
Embedding graphs having Ore-degree at most five
Let and be graphs on vertices, where is sufficiently large.
We prove that if has Ore-degree at most 5 and has minimum degree at
least then Comment: accepted for publication at SIAM J. Disc. Mat
Counting Hamilton cycles in sparse random directed graphs
Let D(n,p) be the random directed graph on n vertices where each of the
n(n-1) possible arcs is present independently with probability p. A celebrated
result of Frieze shows that if then D(n,p) typically
has a directed Hamilton cycle, and this is best possible. In this paper, we
obtain a strengthening of this result, showing that under the same condition,
the number of directed Hamilton cycles in D(n,p) is typically
. We also prove a hitting-time version of this statement,
showing that in the random directed graph process, as soon as every vertex has
in-/out-degrees at least 1, there are typically
directed Hamilton cycles
Hamiltonicity thresholds in Achlioptas processes
In this paper we analyze the appearance of a Hamilton cycle in the following
random process. The process starts with an empty graph on n labeled vertices.
At each round we are presented with K=K(n) edges, chosen uniformly at random
from the missing ones, and are asked to add one of them to the current graph.
The goal is to create a Hamilton cycle as soon as possible.
We show that this problem has three regimes, depending on the value of K. For
K=o(\log n), the threshold for Hamiltonicity is (1+o(1))n\log n /(2K), i.e.,
typically we can construct a Hamilton cycle K times faster that in the usual
random graph process. When K=\omega(\log n) we can essentially waste almost no
edges, and create a Hamilton cycle in n+o(n) rounds with high probability.
Finally, in the intermediate regime where K=\Theta(\log n), the threshold has
order n and we obtain upper and lower bounds that differ by a multiplicative
factor of 3.Comment: 23 page
Power of Choices in the Semi-Random Graph Process
The semi-random graph process is a single player game in which the player is
initially presented an empty graph on vertices. In each round, a vertex
is presented to the player independently and uniformly at random. The player
then adaptively selects a vertex , and adds the edge to the graph. For
a fixed monotone graph property, the objective of the player is to force the
graph to satisfy this property with high probability in as few rounds as
possible.
In this paper, we introduce a natural generalization of this game in which
random vertices are presented to the player in each
round. She needs to select one of the presented vertices and connect to any
vertex she wants. We focus on the following three monotone properties: minimum
degree at least , the existence of a perfect matching, and the existence
of a Hamiltonian cycle.Comment: 18 page
- …