15,804 research outputs found
Determinant Sums for Undirected Hamiltonicity
We present a Monte Carlo algorithm for Hamiltonicity detection in an
-vertex undirected graph running in time. To the best of
our knowledge, this is the first superpolynomial improvement on the worst case
runtime for the problem since the bound established for TSP almost
fifty years ago (Bellman 1962, Held and Karp 1962). It answers in part the
first open problem in Woeginger's 2003 survey on exact algorithms for NP-hard
problems.
For bipartite graphs, we improve the bound to time. Both the
bipartite and the general algorithm can be implemented to use space polynomial
in .
We combine several recently resurrected ideas to get the results. Our main
technical contribution is a new reduction inspired by the algebraic sieving
method for -Path (Koutis ICALP 2008, Williams IPL 2009). We introduce the
Labeled Cycle Cover Sum in which we are set to count weighted arc labeled cycle
covers over a finite field of characteristic two. We reduce Hamiltonicity to
Labeled Cycle Cover Sum and apply the determinant summation technique for Exact
Set Covers (Bj\"orklund STACS 2010) to evaluate it.Comment: To appear at IEEE FOCS 201
Exact Covers via Determinants
Given a k-uniform hypergraph on n vertices, partitioned in k equal parts such
that every hyperedge includes one vertex from each part, the k-dimensional
matching problem asks whether there is a disjoint collection of the hyperedges
which covers all vertices. We show it can be solved by a randomized polynomial
space algorithm in time O*(2^(n(k-2)/k)). The O*() notation hides factors
polynomial in n and k.
When we drop the partition constraint and permit arbitrary hyperedges of
cardinality k, we obtain the exact cover by k-sets problem. We show it can be
solved by a randomized polynomial space algorithm in time O*(c_k^n), where
c_3=1.496, c_4=1.642, c_5=1.721, and provide a general bound for larger k.
Both results substantially improve on the previous best algorithms for these
problems, especially for small k, and follow from the new observation that
Lovasz' perfect matching detection via determinants (1979) admits an embedding
in the recently proposed inclusion-exclusion counting scheme for set covers,
despite its inability to count the perfect matchings
Compressive Phase Contrast Tomography
When x-rays penetrate soft matter, their phase changes more rapidly than
their amplitude. In- terference effects visible with high brightness sources
creates higher contrast, edge enhanced images. When the object is piecewise
smooth (made of big blocks of a few components), such higher con- trast
datasets have a sparse solution. We apply basis pursuit solvers to improve SNR,
remove ring artifacts, reduce the number of views and radiation dose from phase
contrast datasets collected at the Hard X-Ray Micro Tomography Beamline at the
Advanced Light Source. We report a GPU code for the most computationally
intensive task, the gridding and inverse gridding algorithm (non uniform
sampled Fourier transform).Comment: 5 pages, "Image Reconstruction from Incomplete Data VI" conference
7800, SPIE Optical Engineering + Applications 1-5 August 2010 San Diego, CA
United State
Counting Shortest Two Disjoint Paths in Cubic Planar Graphs with an NC Algorithm
Given an undirected graph and two disjoint vertex pairs and
, the Shortest two disjoint paths problem (S2DP) asks for the minimum
total length of two vertex disjoint paths connecting with , and
with , respectively.
We show that for cubic planar graphs there are NC algorithms, uniform
circuits of polynomial size and polylogarithmic depth, that compute the S2DP
and moreover also output the number of such minimum length path pairs.
Previously, to the best of our knowledge, no deterministic polynomial time
algorithm was known for S2DP in cubic planar graphs with arbitrary placement of
the terminals. In contrast, the randomized polynomial time algorithm by
Bj\"orklund and Husfeldt, ICALP 2014, for general graphs is much slower, is
serial in nature, and cannot count the solutions.
Our results are built on an approach by Hirai and Namba, Algorithmica 2017,
for a generalisation of S2DP, and fast algorithms for counting perfect
matchings in planar graphs
An exact general remeshing scheme applied to physically conservative voxelization
We present an exact general remeshing scheme to compute analytic integrals of
polynomial functions over the intersections between convex polyhedral cells of
old and new meshes. In physics applications this allows one to ensure global
mass, momentum, and energy conservation while applying higher-order polynomial
interpolation. We elaborate on applications of our algorithm arising in the
analysis of cosmological N-body data, computer graphics, and continuum
mechanics problems.
We focus on the particular case of remeshing tetrahedral cells onto a
Cartesian grid such that the volume integral of the polynomial density function
given on the input mesh is guaranteed to equal the corresponding integral over
the output mesh. We refer to this as "physically conservative voxelization".
At the core of our method is an algorithm for intersecting two convex
polyhedra by successively clipping one against the faces of the other. This
algorithm is an implementation of the ideas presented abstractly by Sugihara
(1994), who suggests using the planar graph representations of convex polyhedra
to ensure topological consistency of the output. This makes our implementation
robust to geometric degeneracy in the input. We employ a simplicial
decomposition to calculate moment integrals up to quadratic order over the
resulting intersection domain.
We also address practical issues arising in a software implementation,
including numerical stability in geometric calculations, management of
cancellation errors, and extension to two dimensions. In a comparison to recent
work, we show substantial performance gains. We provide a C implementation
intended to be a fast, accurate, and robust tool for geometric calculations on
polyhedral mesh elements.Comment: Code implementation available at https://github.com/devonmpowell/r3
Optimal Control of Transient Flow in Natural Gas Networks
We outline a new control system model for the distributed dynamics of
compressible gas flow through large-scale pipeline networks with time-varying
injections, withdrawals, and control actions of compressors and regulators. The
gas dynamics PDE equations over the pipelines, together with boundary
conditions at junctions, are reduced using lumped elements to a sparse
nonlinear ODE system expressed in vector-matrix form using graph theoretic
notation. This system, which we call the reduced network flow (RNF) model, is a
consistent discretization of the PDE equations for gas flow. The RNF forms the
dynamic constraints for optimal control problems for pipeline systems with
known time-varying withdrawals and injections and gas pressure limits
throughout the network. The objectives include economic transient compression
(ETC) and minimum load shedding (MLS), which involve minimizing compression
costs or, if that is infeasible, minimizing the unfulfilled deliveries,
respectively. These continuous functional optimization problems are
approximated using the Legendre-Gauss-Lobatto (LGL) pseudospectral collocation
scheme to yield a family of nonlinear programs, whose solutions approach the
optima with finer discretization. Simulation and optimization of time-varying
scenarios on an example natural gas transmission network demonstrate the gains
in security and efficiency over methods that assume steady-state behavior
- …