O(n/sup 2/ log n) algorithm
An $O(k^3\log n)$-Approximation Algorithm for Vertex-Connectivity Survivable Network Design
... a 2-approximation algorithm for EC-SNDP, no non-trivial approximation algorithms are known for VC-SNDP, except for restricted special ...a 2-approximation algorithm for the special case when ...
13
A Parallel Algorithm for the Spanning Forest Problem on Proper Circle Graphs
... parallel algorithm for constructing a spanning tree on permutation graphs that runs in O ( log n ) time using O n ( log n ) processors on the EREW (Exclusive Read ...
8
Energy efficient MCDS algorithm for MANETs based on convex hulls
... of 2(H(∆)+1), where H is a harmonic function and ∆ is the degree of the node that has highest number of neighbours in ...second algorithm constructs a Steiner tree that connects all dominator (black) nodes ...
13
Research on an Algorithm of the Acceptable Shortest Path
... given 2-edge connected network G V E , with V n vertexes and E m edges, then there are at least one edge e * whose removal from G V E , will result the greatest increase in the shortest ...
8
Computation of Geographic Location with the Aid of Geospatial Images
... an algorithm which is based on Prim’s ...Prim’s algorithm even this algorithm uses a single priority ...this algorithm, when a component stops growing the new source is set to the vertex with ...
5
Hash Tables with Pseudorandom Global Order
... proposed algorithm is not using the sorting given by the value of the key but the hash of the ...of O(log(n)), when done right, and an average complexity of O(log(log((1 − ...
6
Reconstructing phylogenies from noisy quartets in polynomial time with a high success probability
... randomized algorithm with running time O(n log n log log n) using O(n log n log log n) ...fastest algorithm ...
10
An efficient high dimensional quantum Schur transform
... efficient algorithm for a high dimensional Schur transform that runs in time O(poly(n, log d, log ...in log d. Our algorithm is novel in that it uses the representation ...
21
A stitch in time: Efficient computation of genomic DNA melting bubbles
... rithm 2 is not of a lower quality, but identical to Algorithm 1's ...output. Algorithm 1 was simply ...complexity O(N log N), which is the same as computing melting ...
20
Computing a Longest Common Subsequence of two strings when one of them is Run Length Encoded
... an algorithm that runs in O(gN) time, where g is the length of the RLE string and N is the length of uncompressed ...above algorithm we present another algorithm that runs in O(R ...
8
Behavior of O(log n) Local Commuting Hamiltonians
... of 2 D -LHP over a D dimensional grid ...scales O (| ∂A |) , where | ∂A | is the size of the boundary of ...for 2 and more dimensions remains ...first algorithm that works for all systems in ...
33
A versatile, linear complexity algorithm for flow routing in topographies with depressions
... resolution algorithm – we use here an optimal O(n) algorithm proposed by Barnes et ...our algorithm, we thus need to run them on a temporary copy of the elevation values before ...
14
An Oblivious Parallel RAM with $O(\log^2 N)$ Parallel Runtime Blowup
... of N data blocks, each of size B bits, on the server, and can also store a small amount of data ...ORAM algorithm can be viewed as a sequence of logical accesses Access(op i , addr i , v i 0 ...
12
Achieving quantum supremacy with sparse and noisy commuting quantum computations
... of n qubits in depth O( √ n log n), and which is likely hard to simulate ...classical algorithm that simulates sampling from the resulting distribution, up to constant accu- racy ...
23
From Weak to Strong Linear Programming Gaps for All Constraint Satisfaction Problems
... ∈ N, if there exist (c,s)-integrality gap instances of size n for the relaxation given by t levels of the Sherali–Adams hierarchy, then for all ε > 0 and sufficiently large N, there exists a (c − ...
33
2 Fluoro N o tolylbenzamide
... through N—H···O hydrogen bonds augmented by C—H···π interactions involving the methyl group and the tolyl rings (Table 1, ...Fig. 2). Additional intermolecular C—H···O and C—H···F hydrogen ...
8
rac Bis[μ N salicylidene N' (α phenylsulfanylmethyl 2 oxidobenzyl)propylenediamine N,N′,O,O,O′]nickel(II) dichloromethane solvate
... = 0.98 AÊ. The C atom of the dichloromethane molecule is located on a twofold rotation axis. As a result, the Cl- and H-atom sites are only half occupied. The low precision of the structure is probably due to the low ...
10
N,N′ Bis(2 hydroxyethyl) N,N′ [ethylenedioxybis(o phenylenemethylene)]diammonium fumarate tetrahydrate
... one N,N′-bis(2-hydroxyethyl)-N,N′-[ethylenedioxybis(o-phenylenemethylene)]di- ammonium cation and one fumarate anion located on centers of inversion and two crystallographically ...
7
Efficient Range ORAM with $\mathbb{O}(\log^{2}{N})$ Locality
... Instead, we use Path ORAM as a comparison point. While Path ORAM is not optimized for seek performance, it does provide a good baseline and the addition of the locality-aware physical layout with a relaxed security ...
17
Aqua(N,N′ disalicylideneethylenediamino N,N′,O,O′)(4,5 imidazoledicarboxylato O)manganese(III) monohydrate
... C15 0.070 (2) 0.057 (2) 0.0473 (17) −0.0172 (17) 0.0063 (15) 0.0080 (15) C16 0.0541 (16) 0.0377 (15) 0.0318 (13) −0.0138 (13) −0.0040 (11) 0.0014 (11) C17 0.0357 (14) 0.0339 (14) 0.0406 (14) 0.0014 (11) ...
9