80,488 research outputs found
Approximating Source Location and Star Survivable Network Problems
In Source Location (SL) problems the goal is to select a mini-mum cost source
set such that the connectivity (or flow) from
to any node is at least the demand of . In many SL problems
if , namely, the demand of nodes selected to is
completely satisfied. In a node-connectivity variant suggested recently by
Fukunaga, every node gets a "bonus" if it is selected to
. Fukunaga showed that for undirected graphs one can achieve ratio for his variant, where is the maximum demand. We
improve this by achieving ratio \min\{p^*\lnk,k\}\cdot O(\ln (k/q^*)) for a
more general version with node capacities, where is
the maximum bonus and is the minimum capacity. In
particular, for the most natural case considered by Fukunaga, we
improve the ratio from to . We also get ratio
for the edge-connectivity version, for which no ratio that depends on only
was known before. To derive these results, we consider a particular case of the
Survivable Network (SN) problem when all edges of positive cost form a star. We
give ratio for this variant, improving over the best
ratio known for the general case of Chuzhoy and Khanna
Low-density series expansions for directed percolation I: A new efficient algorithm with applications to the square lattice
A new algorithm for the derivation of low-density series for percolation on
directed lattices is introduced and applied to the square lattice bond and site
problems. Numerical evidence shows that the computational complexity grows
exponentially, but with a growth factor \lambda < \protect{\sqrt[8]{2}},
which is much smaller than the growth factor \lambda = \protect{\sqrt[4]{2}}
of the previous best algorithm. For bond (site) percolation on the directed
square lattice the series has been extended to order 171 (158). Analysis of the
series yields sharper estimates of the critical points and exponents.Comment: 20 pages, 8 figures (3 of them > 1Mb
Exact Distance Oracles for Planar Graphs with Failing Vertices
We consider exact distance oracles for directed weighted planar graphs in the
presence of failing vertices. Given a source vertex , a target vertex
and a set of failed vertices, such an oracle returns the length of a
shortest -to- path that avoids all vertices in . We propose oracles
that can handle any number of failures. More specifically, for a directed
weighted planar graph with vertices, any constant , and for any , we propose an oracle of size
that answers queries in
time. In particular, we show an
-size, -query-time
oracle for any constant . This matches, up to polylogarithmic factors, the
fastest failure-free distance oracles with nearly linear space. For single
vertex failures (), our -size,
-query-time oracle improves over the previously best
known tradeoff of Baswana et al. [SODA 2012] by polynomial factors for , . For multiple failures, no planarity exploiting
results were previously known
Low-density series expansions for directed percolation I: A new efficient algorithm with applications to the square lattice
A new algorithm for the derivation of low-density series for percolation on
directed lattices is introduced and applied to the square lattice bond and site
problems. Numerical evidence shows that the computational complexity grows
exponentially, but with a growth factor \lambda < \protect{\sqrt[8]{2}},
which is much smaller than the growth factor \lambda = \protect{\sqrt[4]{2}}
of the previous best algorithm. For bond (site) percolation on the directed
square lattice the series has been extended to order 171 (158). Analysis of the
series yields sharper estimates of the critical points and exponents.Comment: 20 pages, 8 figures (3 of them > 1Mb
- β¦