8,570 research outputs found
On Routh-Steiner Theorem and Generalizations
Following Coxeter we use barycentric coordinates in affine geometry to prove
theorems on ratios of areas. In particular, we prove a version of Routh-Steiner
theorem for parallelograms.Comment: 11 pages, 4 figure
Reachability Preservers: New Extremal Bounds and Approximation Algorithms
We abstract and study \emph{reachability preservers}, a graph-theoretic
primitive that has been implicit in prior work on network design. Given a
directed graph and a set of \emph{demand pairs} , a reachability preserver is a sparse subgraph that preserves
reachability between all demand pairs.
Our first contribution is a series of extremal bounds on the size of
reachability preservers. Our main result states that, for an -node graph and
demand pairs of the form for a small node subset ,
there is always a reachability preserver on edges. We
additionally give a lower bound construction demonstrating that this upper
bound characterizes the settings in which size reachability preservers
are generally possible, in a large range of parameters.
The second contribution of this paper is a new connection between extremal
graph sparsification results and classical Steiner Network Design problems.
Surprisingly, prior to this work, the osmosis of techniques between these two
fields had been superficial. This allows us to improve the state of the art
approximation algorithms for the most basic Steiner-type problem in directed
graphs from the of Chlamatac, Dinitz, Kortsarz, and
Laekhanukit (SODA'17) to .Comment: SODA '1
Coupling Harmonic Functions-Finite Elements for Solving the Stream Function-Vorticity Stokes Problem
We consider the bidimensional Stokes problem for incompressible fluids in stream function-vorticity form. The classical finite element method of degree one usually used does not allow the vorticity on the boundary of the domain to be computed satisfactorily when the meshes are unstructured and does not converge optimally. To better approach the vorticity along the boundary, we propose that harmonic functions obtained by integral representation be used. Numerical results are very satisfactory, and we prove that this new numerical scheme leads to an optimal convergence rate of order 1 for the natural norm of the vorticity and, under higher regularity assumptions, from 3/2 to 2 for the quadratic norm of the vorticity
Distributed PCP Theorems for Hardness of Approximation in P
We present a new distributed model of probabilistically checkable proofs
(PCP). A satisfying assignment to a CNF formula is
shared between two parties, where Alice knows , Bob knows
, and both parties know . The goal is to have
Alice and Bob jointly write a PCP that satisfies , while
exchanging little or no information. Unfortunately, this model as-is does not
allow for nontrivial query complexity. Instead, we focus on a non-deterministic
variant, where the players are helped by Merlin, a third party who knows all of
.
Using our framework, we obtain, for the first time, PCP-like reductions from
the Strong Exponential Time Hypothesis (SETH) to approximation problems in P.
In particular, under SETH we show that there are no truly-subquadratic
approximation algorithms for Bichromatic Maximum Inner Product over
{0,1}-vectors, Bichromatic LCS Closest Pair over permutations, Approximate
Regular Expression Matching, and Diameter in Product Metric. All our
inapproximability factors are nearly-tight. In particular, for the first two
problems we obtain nearly-polynomial factors of ; only
-factor lower bounds (under SETH) were known before
- …