4,959 research outputs found
Packing spanning graphs from separable families
Let be a separable family of graphs. Then for all positive
constants and and for every sufficiently large integer ,
every sequence of graphs of order and maximum
degree at most such that packs into . This improves results of
B\"ottcher, Hladk\'y, Piguet, and Taraz when is the class of trees
and of Messuti, R\"odl, and Schacht in the case of a general separable family.
The result also implies approximate versions of the Oberwolfach problem and of
the Tree Packing Conjecture of Gy\'arf\'as (1976) for the case that all trees
have maximum degree at most . The proof uses the local resilience of
random graphs and a special multi-stage packing procedure
Ising formulations of many NP problems
We provide Ising formulations for many NP-complete and NP-hard problems,
including all of Karp's 21 NP-complete problems. This collects and extends
mappings to the Ising model from partitioning, covering and satisfiability. In
each case, the required number of spins is at most cubic in the size of the
problem. This work may be useful in designing adiabatic quantum optimization
algorithms.Comment: 27 pages; v2: substantial revision to intro/conclusion, many more
references; v3: substantial revision and extension, to-be-published versio
Algorithms to Approximate Column-Sparse Packing Problems
Column-sparse packing problems arise in several contexts in both
deterministic and stochastic discrete optimization. We present two unifying
ideas, (non-uniform) attenuation and multiple-chance algorithms, to obtain
improved approximation algorithms for some well-known families of such
problems. As three main examples, we attain the integrality gap, up to
lower-order terms, for known LP relaxations for k-column sparse packing integer
programs (Bansal et al., Theory of Computing, 2012) and stochastic k-set
packing (Bansal et al., Algorithmica, 2012), and go "half the remaining
distance" to optimal for a major integrality-gap conjecture of Furedi, Kahn and
Seymour on hypergraph matching (Combinatorica, 1993).Comment: Extended abstract appeared in SODA 2018. Full version in ACM
Transactions of Algorithm
Ninth and Tenth Order Virial Coefficients for Hard Spheres in D Dimensions
We evaluate the virial coefficients B_k for k<=10 for hard spheres in
dimensions D=2,...,8. Virial coefficients with k even are found to be negative
when D>=5. This provides strong evidence that the leading singularity for the
virial series lies away from the positive real axis when D>=5. Further analysis
provides evidence that negative virial coefficients will be seen for some k>10
for D=4, and there is a distinct possibility that negative virial coefficients
will also eventually occur for D=3.Comment: 33 pages, 12 figure
The number of Hamiltonian decompositions of regular graphs
A Hamilton cycle in a graph is a cycle passing through every vertex
of . A Hamiltonian decomposition of is a partition of its edge
set into disjoint Hamilton cycles. One of the oldest results in graph theory is
Walecki's theorem from the 19th century, showing that a complete graph on
an odd number of vertices has a Hamiltonian decomposition. This result was
recently greatly extended by K\"{u}hn and Osthus. They proved that every
-regular -vertex graph with even degree for some fixed
has a Hamiltonian decomposition, provided is sufficiently
large. In this paper we address the natural question of estimating ,
the number of such decompositions of . Our main result is that
. In particular, the number of Hamiltonian
decompositions of is
Weighted Min-Cut: Sequential, Cut-Query and Streaming Algorithms
Consider the following 2-respecting min-cut problem. Given a weighted graph
and its spanning tree , find the minimum cut among the cuts that contain
at most two edges in . This problem is an important subroutine in Karger's
celebrated randomized near-linear-time min-cut algorithm [STOC'96]. We present
a new approach for this problem which can be easily implemented in many
settings, leading to the following randomized min-cut algorithms for weighted
graphs.
* An -time sequential algorithm:
This improves Karger's and bounds when the input graph is not extremely
sparse or dense. Improvements over Karger's bounds were previously known only
under a rather strong assumption that the input graph is simple [Henzinger et
al. SODA'17; Ghaffari et al. SODA'20]. For unweighted graphs with parallel
edges, our bound can be improved to .
* An algorithm requiring cut queries to compute the min-cut of
a weighted graph: This answers an open problem by Rubinstein et al. ITCS'18,
who obtained a similar bound for simple graphs.
* A streaming algorithm that requires space and
passes to compute the min-cut: The only previous non-trivial exact min-cut
algorithm in this setting is the 2-pass -space algorithm on simple
graphs [Rubinstein et al., ITCS'18] (observed by Assadi et al. STOC'19).
In contrast to Karger's 2-respecting min-cut algorithm which deploys
sophisticated dynamic programming techniques, our approach exploits some cute
structural properties so that it only needs to compute the values of cuts corresponding to removing pairs of tree edges, an
operation that can be done quickly in many settings.Comment: Updates on this version: (1) Minor corrections in Section 5.1, 5.2;
(2) Reference to newer results by GMW SOSA21 (arXiv:2008.02060v2), DEMN
STOC21 (arXiv:2004.09129v2) and LMN 21 (arXiv:2102.06565v1
A hard-sphere model on generalized Bethe lattices: Statics
We analyze the phase diagram of a model of hard spheres of chemical radius
one, which is defined over a generalized Bethe lattice containing short loops.
We find a liquid, two different crystalline, a glassy and an unusual
crystalline glassy phase. Special attention is also paid to the close-packing
limit in the glassy phase. All analytical results are cross-checked by
numerical Monte-Carlo simulations.Comment: 24 pages, revised versio
Community Structure in Industrial SAT Instances
Modern SAT solvers have experienced a remarkable progress on solving
industrial instances. Most of the techniques have been developed after an
intensive experimental process. It is believed that these techniques exploit
the underlying structure of industrial instances. However, there are few works
trying to exactly characterize the main features of this structure.
The research community on complex networks has developed techniques of
analysis and algorithms to study real-world graphs that can be used by the SAT
community. Recently, there have been some attempts to analyze the structure of
industrial SAT instances in terms of complex networks, with the aim of
explaining the success of SAT solving techniques, and possibly improving them.
In this paper, inspired by the results on complex networks, we study the
community structure, or modularity, of industrial SAT instances. In a graph
with clear community structure, or high modularity, we can find a partition of
its nodes into communities such that most edges connect variables of the same
community. In our analysis, we represent SAT instances as graphs, and we show
that most application benchmarks are characterized by a high modularity. On the
contrary, random SAT instances are closer to the classical Erd\"os-R\'enyi
random graph model, where no structure can be observed. We also analyze how
this structure evolves by the effects of the execution of a CDCL SAT solver. In
particular, we use the community structure to detect that new clauses learned
by the solver during the search contribute to destroy the original structure of
the formula. This is, learned clauses tend to contain variables of distinct
communities
- …