Results 1 
5 of
5
Sensitivity Analysis of Minimum Spanning Trees in SubInverseAckermann Time
, 2015
"... We present a deterministic algorithm for computing the sensitivity of a minimum spanning tree (MST) or shortest path tree in O(m logα(m,n)) time, where α is the inverseAckermann function. This improves upon a long standing bound of O(mα(m,n)) established by Tarjan. Our algorithms are based on an e ..."
Abstract

Cited by 8 (4 self)
 Add to MetaCart
We present a deterministic algorithm for computing the sensitivity of a minimum spanning tree (MST) or shortest path tree in O(m logα(m,n)) time, where α is the inverseAckermann function. This improves upon a long standing bound of O(mα(m,n)) established by Tarjan. Our algorithms are based on an efficient splitfindmin data structure, which maintains a collection of sequences of weighted elements that may be split into smaller subsequences. As far as we are aware, our splitfindmin algorithm is the first with superlinear but subinverseAckermann complexity. We also give a reduction from MST sensitivity to the MST problem itself. Together with the randomized linear time MST algorithm of Karger, Klein, and Tarjan, this gives another randomized linear time MST sensitivity algorithm.
Path Minima Queries in Dynamic Weighted Trees
"... In the path minima problem on trees each tree edge is assigned a weight and a query asks for the edge with minimum weight on a path between two nodes. For the dynamic version of the problem on a tree, where the edgeweights can be updated, we give comparisonbased and RAM data structures that achi ..."
Abstract

Cited by 6 (0 self)
 Add to MetaCart
(Show Context)
In the path minima problem on trees each tree edge is assigned a weight and a query asks for the edge with minimum weight on a path between two nodes. For the dynamic version of the problem on a tree, where the edgeweights can be updated, we give comparisonbased and RAM data structures that achieve optimal query time. These structures support inserting a node on an edge, inserting a leaf, and contracting edges. When only insertion and deletion of leaves in a tree are needed, we give two data structures that achieve optimal and significantly lower query times than when updating the edgeweights is allowed. One is a semigroup structure for which the edgeweights are from an arbitrary semigroup and queries ask for the semigroupsum of the edgeweights on a given path. For the other structure the edgeweights are given in the word RAM. We complement these upper bounds with lower bounds for different variants of the problem.
Sharp Bounds on DavenportSchinzel Sequences of Every Order
, 2013
"... One of the oldest unresolved problems in extremal combinatorics is to determine the maximum length of DavenportSchinzel sequences, where an orders DS sequence is defined to be one over an nletter alphabet that avoids alternating subsequences of the form a · · · b · · · a · · · b · · · wit ..."
Abstract

Cited by 4 (1 self)
 Add to MetaCart
One of the oldest unresolved problems in extremal combinatorics is to determine the maximum length of DavenportSchinzel sequences, where an orders DS sequence is defined to be one over an nletter alphabet that avoids alternating subsequences of the form a · · · b · · · a · · · b · · · with length s + 2. These sequences were introduced by Davenport and Schinzel in 1965 to model a certain problem in differential equations and have since become an indispensable tool in computational geometry and the analysis of discrete geometric structures. Let λs(n) be the extremal function for such sequences. What is λs asymptotically? This question has been answered satisfactorily (by Hart and Sharir, Agarwal, Sharir, and Shor, and Nivasch) when s is even or s ≤ 3. However, since the work of Agarwal, Sharir, and Shor in the 1980s there has been a persistent gap in our understanding of the odd orders, a gap that is just as much qualitative as quantitative. In this paper we establish the following bounds on λs(n) for every order s. n s = 1 2n − 1 s = 2 ⎪ ⎨ 2nα(n) + O(n) s = 3 λs(n) = Θ(n2 α(n) ) s = 4 Θ(nα(n)2 α(n) ) s = 5 n2 (1+o(1))αt (n)/t! s ≥ 6, t = ⌊ s−2 2 ⌋ These results refute a conjecture of Alon, Kaplan, Nivasch, Sharir, and Smorodinsky and run counter to common sense. When s is odd, λs behaves essentially like λs−1.
Succinct indices for path minimum, with applications to path reporting
, 2014
"... In the path minimum query problem, we preprocess a tree on n weighted nodes, such that given an arbitrary path, we can locate the node with the smallest weight along this path. We design novel succinct indices for this problem; one of our index structures supports queries in O((m;n)) time, and occ ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
(Show Context)
In the path minimum query problem, we preprocess a tree on n weighted nodes, such that given an arbitrary path, we can locate the node with the smallest weight along this path. We design novel succinct indices for this problem; one of our index structures supports queries in O((m;n)) time, and occupies O(m) bits of space in addition to the space required for the input tree, where m is an integer greater than or equal to n and (m;n) is the inverseAckermann function. These indices give us the first succinct data structures for the path minimum problem, and allow us to obtain new data structures for path reporting queries, which report the nodes along a query path whose weights are within a query range. We achieve three different time/space tradeoffs for path reporting by designing (a) an O(n)word structure with O(lgϵ n+ occ lgϵ n) query time, where occ is the number of nodes reported; (b) an O(n lg lgn)word structure with O(lg lg n+ occ lg lgn) query time; and (c) an O(n lgϵ n)word structure with O(lg lg n+occ) query time. These tradeoffs match the state of the art of twodimensional orthogonal range reporting queries [8] which can be treated as a special case of path reporting queries. When the number of distinct weights is much smaller than n, we further improve both the query time and the space cost of these three results.
Sources of Superlinearity in DavenportSchinzel Sequences
"... A generalized DavenportSchinzel sequence is one over a finite alphabet that contains no subsequences isomorphic to a fixed forbidden subsequence. One of the fundamental problems in this area is bounding (asymptotically) the maximum length of such sequences. Following Klazar, let Ex(σ, n) be the max ..."
Abstract
 Add to MetaCart
(Show Context)
A generalized DavenportSchinzel sequence is one over a finite alphabet that contains no subsequences isomorphic to a fixed forbidden subsequence. One of the fundamental problems in this area is bounding (asymptotically) the maximum length of such sequences. Following Klazar, let Ex(σ, n) be the maximum length of a sequence over an alphabet of size n avoiding subsequences isomorphic to σ. It has been proved that for every σ, Ex(σ, n) is either linear or very close to linear; in particular it is O(n2 α(n)O(1)), where α is the inverseAckermann function and O(1) depends on σ. However, very little is known about the properties of σ that induce superlinearity of Ex(σ, n). In this paper we exhibit an infinite family of independent superlinear forbidden subsequences. To be specific, we show that there are 17 prototypical superlinear forbidden subsequences, some of which can be made arbitrarily long through a simple padding operation. Perhaps the most novel part of our constructions is a new succinct code for representing superlinear forbidden subsequences.