In the stable 0-1 sorting problem the task is to sort an array of n elements with two distinct values such that equal elements retain their relative input order. Recently, Munro, Raman and Salowe [BIT 1990] gave an algorithm which solves this problem in O(nlog*n)3 time and constant extra space. We show that by a modification of their method the stable 0-1 sorting is possible in O(n) time and O(...

Let G be a graph and let P (n) denote an element from a one-parameter family of graphs, such as a path of length n, a cycle of length n, or a complete binary tree of height n. We are concerned with determining minimum dominating sets of graphs of the form G P (n). Using dynamic programming and properties of finite state spaces, we show a constant time algorithm to produce a minimum dominating s...

The article deals with the minimum-time running problem. The time of covering a given distance is minimized. The Hill-Keller model of running employed is based on Newton's second law and the equation of power balance. The problem is formulated in optimal control. The unknown function is the runner's velocity that varies with the distance. The problem is solved applying the direct Chebyshev's ps...

Ahatract-We investigate the existence and uniqueness of robust time-optimal control solutions of flexible structures for rest-torest motion. We show that several robust time-optimal control designs for flexible systems are equivalent to traditional nonrobust time-optimal controls for difirent systems. This equivalence implies that the robust time-optimal controllers must then have all the prope...

We show that the length of the minimum weight Steiner triangulation (MWST) of a point set can be approximated within a constant factor by a triangulation algorithm based on quadtrees. In O(n log n) time we can compute a triangulation with O(n) new points, and no obtuse triangles, that approximates the MWST. We can also approximate the MWST with triangulations having no sharp angles. We generali...

We present eecient algorithms for nding rectilinear collision-free paths between two given points among a set of rectilinear obstacles. Our results improve the time complexity of previous results for nding the shortest rectilinear path, the minimum-bend shortest rectilinear path, the shortest minimum-bend rectilinear path and the minimum-cost rectilinear path. For nding the shortest rectilinear...

In this paper, we consider the inverse spanning tree problem. Given an undi0 Ž 0 0 . rected graph G s N , A with n nodes, m arcs, an arc cost vector c, and a spanning tree T 0, the inverse spanning tree problem is to perturb the arc cost vector c to a vector d so that T 0 is a minimum spanning tree with respect to the < < < < cost vector d and the cost of perturbation given by d y c s Ý d y c i...

worldwide networks of seismic recording instruments mostly record only translational ground motion in two or three orthogonal directions. rotational component of earthquake is not commonly recorded. several theories are available to estimate a torsional component from recorded translational components of ground motion. in this paper detailed investigations are made to study the relative perform...

results the total number of time-loss injuries and matches missed rose from 129 and 506 respectively in 2008 - 2009 to 202 and 1110 in 2010 - 2011. following the introduction of ‘minimum medical standards’, both categories decreased (significantly for matches missed). these time-loss injuries and matches missed led to high costs of up to aud$ 37,317,029.29 (2012 - 2013 season). the same trend w...