Showing papers in "Journal of Algorithms in 2003"

TL;DR: In this paper, the data structure of the compressed suffix array is modified so that pattern matching can be done without any access to the text, and new operations search, decompress and inverse are added.

TL;DR: A rather simple algorithm for the single source shortest path problem, which the authors call Delta-stepping, can be implemented very efficiently in sequential and parallel setting for a large class of graphs and achieves significant speedup on real machines.

TL;DR: In this article, the authors define feasible distance measures that reflect how close a given pattern H is to some part of a larger pattern G. These distance measures are generalizations of the well-known Frechet distance for curves.

TL;DR: A different algorithm, based on geometric separators, that requires only linear space is described, that can also be applied to piercing, yielding the first PTAS for that problem.

TL;DR: A centralized randomized polynomial time algorithm is presented that given a network and a source, outputs a schedule for broadcasting the message from the source to the rest of the network.

TL;DR: This paper presents a routing strategy called Pivot Interval Routing (PIR), which allows message routing on every weighted n-node network along paths whose stretch factor is at most five, and there is no loop-free routing strategy guaranteeing a memory bound of at most √n bits per node for all networks, regardless of the route lengths.

TL;DR: The main result is that if the range of ω is restricted to positive reals ≥ 1, then so-called REAL-WVC can be solved in time O(1.3954k + k|V|).

TL;DR: In this paper, the authors introduce a time-dependent generalization of TSP called Moving-Target TSP, where a pursuer must intercept in minimum time a set of targets which move with constant velocities.

TL;DR: A polynomial-time approximation scheme (PTAS) for Multicut in unweighted graphs with bounded degree and bounded tree-width and some hardness results are provided: it is proved that Multicut is still NP-hard for binary trees and that it is Max SNP-hard if the authors drop any of the three conditions.

TL;DR: A generalization of the classical facility location problem, where every demand point j must be served by rj facilities instead of just one, is considered, and a factor 4 approximation is obtained through the application of various rounding techniques to the linear relaxation of an integer program formulation.

TL;DR: This work gives a parameterized algorithm GREEDYα that belongs to the class of "myopic" algorithms, which are deterministic algorithms that process the given intervals in order of non-decreasing right endpoint and can either reject or select each interval (rejections are irrevocable).

TL;DR: In this article, a simple O(n)-time algorithm was proposed to construct a floorplan for any n-node plane triangulation, which can fit the floorplan area in a rectangle of size (n - 1) × ⌊(2n + 1)/3⌋.

TL;DR: In this paper, the authors considered the projective clustering problem and gave a randomized algorithm that computes O(k log k) strips of width at most w* that cover a set S of n points in road and an integer k > 0.

TL;DR: Two output-sensitive algorithms are presented, for simple paths and non-simple paths, that improves the previous algorithm on homotopic shortest paths and achieves an improvement by a factor of O(n) time per output vertex.

TL;DR: A linear time algorithm which, given a tree, computes a linear layout optimal with respect to vertex separation and improves the running time of former algorithms from O(n log n) to O( n) and answers the open questions raised in Ellis et al.

TL;DR: In this paper, loss-bounded analysis is used to estimate the loss of an online policy in DiffServ networks, where the loss is defined as the loss between an optimal offline policy plus a constant fraction of the benefit of the online policy.

TL;DR: In this paper, the authors consider the problem of finding a common superobject of size bounded by |Σ|+r and the parameter is the pair (k, r) and show that without this restriction, both problems are harder than Directed Feedback Vertex Set, for which parameterized complexity is famously unresolved.

TL;DR: It is shown that for every instance I, it is the case that either Lax, or the well-known deterministic algorithm SRPT (Shortest Remaining Processing Time), is constant competitive on I, and an immediate consequence is a constant competitive randomized algorithm for this problem.

TL;DR: This work proposes a very simple algorithm based on standard data structure to locate a MER of largest area in the plane, which reserves O(n log n) space on an average to maintain the required data structure during the execution of the algorithm.

TL;DR: The MATRIX-TO-LINE algorithm is applied to the Radiation Hybrid problem, namely, the algorithmic part of a physical mapping method called RH mapping, and is shown to be the first algorithm with a guaranteed convergence for the general RH problem.

TL;DR: In this paper, the results of a large-scale experimental study of quartet-based methods (quartet cleaning and puzzling) for phylogeny reconstruction were presented. But the results were limited.

TL;DR: The problem of sequencing n equal-length jobs on m identical machines to minimize the maximal job completion time subject to release and delivery times is considered and an algorithm is proposed which improves the running time of previously known algorithms.

TL;DR: This paper shows how to achieve optimum total flow time and optimum max-stretch if the authors increase the capacity of the underlying network by a logarithmic factor.

TL;DR: In this article, a fully dynamic single source shortest path algorithm for directed graphs with arbitrary arc weights was proposed, which works for any digraph and has optimal space requirements and query time.

TL;DR: The main result is a polynomial time algorithm for the rectangle perimeter labeling problem, where the points to be labeled lie on the boundary of a rectangular map.

TL;DR: In this article, the problem of finding all occurrences of a pattern in a compressed text in 2D-LZ compressed form was studied and a strongly inplace algorithm was proposed.

TL;DR: This paper shows that in many practical cases, the running time is constant and the space complexity is polynomial, and it is shown that if the schedule is given in a natural tree representation, then there exists a way to get the best possible running time per slot for a given space parameter.

TL;DR: The limit laws of three cost measures of two algorithms for finding the maximum in a single-channel broadcast communication model are derived in this article, where coin flips and comparisons are used.

TL;DR: In this paper, a dynamic programming table is used to generate the standard bracketing for all Lyndon words of length n, thus constructing a basis for the nth homogeneous component of the free Lie algebra.

TL;DR: This paper presents a 2-approximation algorithm for the path coloring problem, which is to color a set of paths with the smallest number of colors so that any two paths sharing an edge are assigned different colors.