Showing papers in "Journal of Algorithms in 1993"

TL;DR: In this paper, a 2 k − 1 competitive algorithm for online minimum weighted bipartite matching was proposed, where 2 k is the number of nodes and 1 is the minimum number of vertices.

TL;DR: The paper discusses the significant parameters of center allocation, defines the resulting optimization problems, and proposes several approximation algorithms for selecting centers and for distributing the users among them.

TL;DR: If at least one graph H i is a minor of a 2 × k grid graph, and at leastOne graph Hi is aMinor of a circus graph, then one can test in \(\mathcal{O}\)(n) time whether a given graph G contains at leastone graph H∈{H1, ..., H c } as a minor.

TL;DR: An O (log log n ) time optimal parallel algorithm is given for the all nearest smaller values problem and it is shown that any optimal CRCW PRAM algorithm for the triangulation problem requires Ω( log log n) time.

TL;DR: The problem of increasing the connectivity1 of a graph at an optimal cost is studied, and an efficient approximation schemes that come within a constant factor from the optimal are focused on.

TL;DR: This proof provides the basis of an algorithm for generating all binary trees that can be implemented to run on a pointer machine and to use only constant time between the output of successive trees.

TL;DR: An improved algorithm for computing the extreme points of an n-point set P in Ed, improved output-sensitive computation of convex hulls and Voronoi diagrams, and a Monte-Carlo algorithm for estimating the volume of a convex polyhedron given by the set of its vertices (in a fixed dimension).

TL;DR: Several fast approximation algorithms are presented for the problem of finding a minimum-cost tour to transport a set of objects between the vertices of an edge-weighted tree by a vehicle that travels along the edges of the tree.

TL;DR: It is proved that the bisection width of the class of planar graphs and trees of n vertices and maximum degree k is O ([formula] and O ( k log n /log k ), respectively, both optimal within a constant factor.

TL;DR: A modified version of the protocol yields a weak shared coin whose bias is guaranteed to be in the range 1/2 ± ϵ regardless of scheduler behavior, and which is the first such protocol for the shared-memory model to guarantee that all processors agree on the outcome of the coin.

TL;DR: This work is motivated by a resource allocation problem dealing with a partially replicated distributed database defined on a tree network and gives a one-pass algorithm for finding the core of a tree and a generalization of a core which is a k -tree core.

TL;DR: This paper presents the first sublinear-time deterministic parallel algorithms for bipartite matching and several related problems, including maximal node-disjoint paths, depth-first search, and flows in zero-one networks.

TL;DR: This paper introduces a technique involving perfect hash functions that leads to a deterministic algorithm for ordered compaction running on a CRCW PRAM in time O(log k/log log n) using n processors and a matching lower bound for unordered compaction.

TL;DR: It is proved that the time required to complete transmission of a packet in a set is bounded by its route length plus the number of other packets in the set, which holds for any greedy algorithm, even in the ease of different starting times and different route lengths.

TL;DR: The best case for the number of moves is ∼ 12N lg N + O(N) in the worst case as mentioned in this paper, which is the same as the best case in the average case.

TL;DR: This paper presents an undirected analogue to the result of Cheng and Hwang, who recently found an O (log n ) algorithm for computing diameters of directed double-loop networks.

TL;DR: A transformer takes a distributed algorithm whose message complexity is O(ƒ · m) and produces a new distributed algorithm to solve the same problem with O(n log n + m log n) message complexity, where n and m are the total number of nodes and links in the network.

TL;DR: It is proved that finding an NC algorithm for perfect matching in slightly less dense graphs (minimum degree is at least (12 ? ?)|V|) is as hard as the same problem for all graphs, and interestingly the problem of finding a Hamiltonian cycle becomes NP-complete.

TL;DR: This paper shows that open shop is NP-hard in the ordinary sense and flow shop isNP- hard in the strong sense, and a linear time algorithm is given to produce optimal schedules for two-machine open shops if the optimal order of completion times is known in advance.

TL;DR: Two algorithms for listing all the ideals of a forest poset are presented, one of which has the property that the amount of computation between successive ideals is O(1); such algorithms are said to be loopless.

TL;DR: Most of the data structures presented here use close to linear space and have query time close to O (√ n + K ) or O ( n 2/3 + K ), where K is the size of the output.

TL;DR: A simple linear time algorithm is given that solves the problem of determining whether a given colored graph can be triangulated, such that no edges between vertices of the same color are added.

TL;DR: A linear time algorithm for embedding graphs in the projective plane is presented and its application to graph embedding is shown to be straightforward and efficient.

TL;DR: A linear equivalence is established between the maximum flow problem for 0-1 networks and the minimum g-deficiency problem in the bipartite graphs and the best known complexity bounds on the various cases of themaximum flow problem are derived from the best maximum flow algorithms.

TL;DR: An algorithm for computing a center placement for S, a set of points in the plane and a segment, is presented, whose running time is O(n^{2} \alpha (n) \, \mbox {log} ^{3}n), where $\alpha ( n)$ is the inverse Ackermann function.

TL;DR: This work shows that sorting a sufficiently long list of length N using Shellsort with m increments requires at least Nl+c/√m comparisons in the worst case and proves that Ω(N(log N/log log N)2) comparisons are needed regardless of the number of increments.

TL;DR: A new efficient channel routing algorithm in the knock-knee mode that routes every solvable channel routing problem, uses minimum area, runs in time linear in the size of the routing area, and produces a layout with minimum total wire length if the channel is dense.

TL;DR: A probabilistic polynomial time algorithm which on input aPolynomial g(x1,..., xn) over GF[2], ϵ and δ, outputs an approximation to the number of zeroes of g with relative error at most ϵ with probability at least 1 − δ.

TL;DR: An O (n log n ) time and O ( n ) space algorithm for determining whether there is a line segment inside a polygon P from which P is weakly visible, and for finding such a line segments if it exists, where n is the number of vertices of P.