Showing papers in "Journal of Algorithms in 1988"

TL;DR: A bottleneck optimization problem on a graph with edge costs is the problem of finding a subgraph of a certain kind that minimizes the maximum edge cost in the subgraph, and a fast algorithms for two bottleneck optimization problems are proposed.

TL;DR: A simple and efficient heuristic algorithm for the graph coloring problem is described and it is shown that for all k ≥ 1, it finds an optimal coloring for almost all k -colorable graphs.

TL;DR: The proof is based on showing that every 3-connected graph has a nonseparating ear decomposition, and it is shown that three independent spanning trees of G rooted at r can be found in O ( VE ) time.

TL;DR: A new algorithm simulates the Lovasz algorithm through approximate arithmetic, which uses at most O ( n 4 log B ) arithmetic operations on O-bit integers to transform a given integer lattice basis into a reduced basis.

TL;DR: It is shown that the concave least weight subsequence problem can always be solved in O(n) time, without any extra conditions.

TL;DR: This work considers the 2-dimensional range searching problem in the case where all points lie on an integer grid and presents a new data structure that solves range queries on a U ∗ U grid in O(k + log log U) time using O(n log n) storage.

TL;DR: An algorithm is presented which finds a maximum stable set of a family of n arcs on a circle in O ( n log n ) time given the arcs as an unordered list of their endpoints or in O( n) time if they are already sorted.

TL;DR: It is proved that the m th factorial moment of the depth of a leaf in a trie with n keys is equal to α ln m n + β lN m −1 n + O (ln m −2 n ), where the constants α and β are functions of the probabilities, p i , i = 1,…, V .

TL;DR: It is shown that any algorithm that solves the FAS problem or the vertex-weighted FVS problem on reducible flow graphs has time complexity at least that of finding a minimum cut in a flow network, for which the best algorithms currently known have time complexity.

TL;DR: The properties of a particular generalization of Voronoi diagrams called power diagrams are exploited to obtain new and improved algorithms for union, intersection, and measure problems for discs and balls.

TL;DR: It is shown that the class of graphs for which the contraction algorithm finds a minimum cutset (completely contractible graphs) properly contains the class for which Shamir-Rosen algorithm findsA minimum cut set (quasi-reducible graphs), and thus that the contraction algorithms is more powerful.

TL;DR: A polynomial time algorithm DHAM for finding hamilton cycles in digraphs is described and some applications to random “travelling salesman problems” are discussed.

TL;DR: It is proved that there is an adjacent interchange generation algorithm for C(n, k) if and only if either (i) k is 0, 1, n, n − 1 or (ii) n is even and k is odd.

TL;DR: It is shown that all pairs of rectangularly visible points in a set of size n can be determined in O(n log n + k) time, where k is the number of reported pairs, using O( n) space.

TL;DR: It is shown that any linear algorithm A that computes M x has associated with it a natural dual linear algorithm denoted A T that compute M T y, and a strong correspondence is established between linear algorithms that compute the product M x and bilinear algorithms that computed the bilinoid form y T Mx.

TL;DR: An O(log n) algorithm is obtained for computing the weighted diameter of this network, which is defined as the maximum d(x, y) among all x and y.

TL;DR: An efficient solution to the mixed-integer linear programming variant where some, but not necessarily all, of the unknowns are required to be integers is given.

TL;DR: This paper defines the binary tree algebraic computation (BTAC) problem and develops an efficient parallel algorithm for solving this problem and identifies algorithms within an O (log n ) factor of optimal.

TL;DR: This work investigates the problem of moving a convex body in the plane from one location to another while avoiding a given collection of polygonal obstacles and proposes an O(n2) algorithm for finding a shortest path from the initial to the final location.

TL;DR: The Frobenius value is shown to be rapid, requiring less than O( log a) steps, and the diophantine equation is solved with little extra effort to result in an O(log a) method overall.

TL;DR: The generalized Riemann hypothesis is assumed to be correct, and the factorization of any polynomial with a bounded number of irreducible factors is obtained inPolynomial time.

TL;DR: The main result is that constructing aHamiltonian path in a general tournament and a Hamiltonian cycle in a strongly connected tournament are both in NC.

TL;DR: It is shown that assuming the generalized Riemann hypothesis, there exists a randomized polynomial time reduction from quadratic residuosity to determining whether or not a given 4-dimensional algebra over Q has zero divisors.

TL;DR: An NC algorithm for the Δ vertex coloring problem is given and a novel partition of the graph is introduced which may find applications elsewhere.

TL;DR: If G is solvable—and, more generally, if the nonabelian composition factors of G are suitably restricted—it is shown that the following can be found in polynomial time: a Sylow p- subgroup of G containing a given p-subgroup, and an element of G conjugating a given SyLow p- Subgroup to another.

TL;DR: A fault-tolerant algorithm which guarantees commitment is presented, which can be used in networks in which message transmission is not restricted to the FIFO discipline, and the memory space needed in each node is saved.

TL;DR: The algorithm complexity, O(n3log n), substantially improves a previous algorithm for the same problem and shows the sensitivity and intricate nature of this measure, which may result in an unexpected optimal location under extreme conditions.

TL;DR: A probabilistic algorithm for the computation of the gcd of two univariate integer polynomials of degrees ≤ n with their l1-norms being bounded by 2h and its expected running time by a worst-case bound of O(n(n + h)1 + o(1) bit operations.

TL;DR: A new proof of correctness for the Garsia-Wachs algorithm, which constructs minimum cost binary trees in O ( log n ) time, has a simpler structure and is free of the difficult inductions of the original.

TL;DR: A new approach to computing the collision boundary of a collection of obstacles grown by a convex robot by first representing the robot as a set sum of line segments and triangles.