Applying mod-k-cuts for solving linear ordering problems

The linear ordering problem consists of finding an ordering of the nodes of the weighted complete digraph on n nodes such that the sum of the weights of the arcs compatible with the ordering is maximized. In this paper, we report about the usefulness of mod-k cuts in a branch-and-cut algorithm for solving linear ordering problems to optimality.      

Word morph and topological structures: A graph generating algorithm

An algorithm of generating graph structures for the ordering of datasets is proposed. It operates with the key concept of “sphere neighborhood” and generates the graph structured ordering of datasets, provided the elements of such sets can be related by some similarity relation. The algorithm always allows determining the shortest path between two nodes in a constructive way. It is demonstrated by an application to the famous Word Morph game and in addition to the ordering of logfiles with respect to the detection of errors. Therefore, the algorithm can be very useful for the dealing with Big Data problems. © 2016 Wiley Periodicals, Inc. Complexity 21: 426–436, 2016     

Power-aware scheduling of preemptable jobs on identical parallel processors to minimize makespan

This paper deals with power-aware scheduling of preemptable jobs on identical parallel processors to minimize schedule length when jobs are described by continuous, strictly concave functions relating their processing speed at time t to the amount of power allotted at the moment. Power is a continuous, doubly constrained resource, i.e. both: its availability at time t and consumption over scheduling horizon are constrained. Precedence constraints among jobs are represented by a task-on-arc graph. A methodology based on properties of optimal schedules is presented for solving the problem optimally for a given ordering of nodes in the graph. Heuristics for finding an ordering which leads to possibly short schedules are proposed and examined experimentally.     

The outflow ranking method for weighted directed graphs

A ranking method assigns to every weighted directed graph a (weak) ordering of the nodes. In this paper we axiomatize the ranking method that ranks the nodes according to their outflow using four independent axioms. Besides the well-known axioms of anonymity and positive responsiveness we introduce outflow monotonicity – meaning that in pairwise comparison between two nodes, a node is not doing worse in case its own outflow does not decrease and the other node’s outflow does not increase – and order preservation – meaning that adding two weighted digraphs such that the pairwise ranking between two nodes is the same in both weighted digraphs, then this is also their pairwise ranking in the ‘sum’ weighted digraph. The outflow ranking method generalizes the ranking by outdegree for directed graphs, and therefore also generalizes the ranking by Copeland score for tournaments.     

An Improved Bound on the One-Sided Minimum Crossing Number in Two-Layered Drawings

Given a bipartite graph G = (V,W,E), a two-layered drawing consists of placing nodes in the first node set V on a straight line L₁ and placing nodes in the second node set W on a parallel line L₂. The one-sided crossing minimization problem asks one to find an ordering of nodes in V to be placed on L₁ so that the number of arc crossings is minimized. In this paper we use a 1.4664-approximation algorithm for this problem. This improves the previously best bound 3 due to P. Eades and N. C. Wormald [Edge crossing in drawing bipartite graphs, Algorithmica 11 (1994), 379-403].     

Crossing minimization in weighted bipartite graphs

Given a bipartite graph G=(L₀,L₁,E) and a fixed ordering of the nodes in L₀, the problem of finding an ordering of the nodes in L₁ that minimizes the number of crossings has received much attention in literature. The problem is NP-complete in general and several practically efficient heuristics and polynomial-time algorithms with a constant approximation ratio have been suggested. We generalize the problem and consider the version where the edges have nonnegative weights. Although this problem is more general and finds specific applications in automatic graph layout problems similar to those of the unweighted case, it has not received as much attention. We provide a new technique that efficiently approximates a solution to this more general problem within a constant approximation ratio of 3. In addition we provide appropriate generalizations of some common heuristics usually employed for the unweighted case and compare their performances.     

Average-case analysis of incremental topological ordering

Many applications like pointer analysis and incremental compilation require maintaining a topological ordering of the nodes of a directed acyclic graph (DAG) under dynamic updates. All known algorithms for this problem are either only analyzed for worst-case insertion sequences or only evaluated experimentally on random DAGs. We present the first average-case analysis of incremental topological ordering algorithms. We prove an expected runtime of under insertion of the edges of a complete DAG in a random order for the algorithms of Alpern et al. (1990) [4], Katriel and Bodlaender (2006) [18], and Pearce and Kelly (2006) [23].     

Open queueing networks in discrete time-some limit theorems

A finite number of nodes, each with a single server and infinite buffers, is considered in discrete time. The service may be FIFO and the service times are constant. The external arrivals and the routing decision variables form a general stationary sequence. Stability of the system is proved under these assumptions. Extension to multiple servers at a node and general stationary distributions holds. If the external input is i.i.d. and the routing is Markovian then stochastic ordering, continuity of stationary distributions, rates of convergence, a functional CLT and a functional LIL and various other limit theorems for the queue length process are also proved. Generalizations to multiple servers at nodes, customers with priority, multiple customer classes, general service length and Markov modulated external arrival cases are discussed.     

Parallel multi-frontal solver for p adaptive finite element modeling of multi-physics computational problems

The paper presents a parallel direct solver for multi-physics problems. The solver is dedicated for solving problems resulting from adaptive finite element method computations. The concept of finite element is actually replaced by the concept of the node. The computational mesh consists of several nodes, related to element vertices, edges, faces and interiors. The ordering of unknowns in the solver is performed on the level of nodes. The concept of the node can be efficiently utilized in order to recognize unknowns that can be eliminated at a given node of the elimination tree. The solver is tested on the exemplary three-dimensional multi-physics problem involving the computations of the linear acoustics coupled with linear elasticity. The three-dimensional tetrahedral mesh generation and the solver algorithm are modeled by using graph grammar formalism. The execution time and the memory usage of the solver are compared with the MUMPS solver.     

Partial ordering of the syntax elements of a language

In order to make a syntax directed parsing processor more efficient it is useful to impose a partial ordering on the syntax elements, i.e., terminal characters and defined terms, of the language. To accomplish this for a language given in Backus notation and subject to certain simple restrictions, a graphG is defined whose nodes are the syntax elements of the language and whose arcs are determined by the rules of the language. Algorithms are presented which transform the graphG into an acyclic graphG and which fromG obtain the desired ordering.     

Combination of numerical and structured approaches to the construction of a second-order incomplete triangular factorization in parallel preconditioning methods

Parallel versions of the stabilized second-order incomplete triangular factorization conjugate gradient method in which the reordering of the coefficient matrix corresponding to the ordering based on splitting into subdomains with separators are considered. The incomplete triangular factorization is organized using the truncation of fill-in “by value” at internal nodes of subdomains, and “by value” and ‘by positions” on the separators. This approach is generalized for the case of constructing a parallel version of preconditioning the second-order incomplete LU factorization for nonsymmetric diagonally dominant matrices with. The reliability and convergence rate of the proposed parallel methods is analyzed. The proposed algorithms are implemented using MPI, results of solving benchmark problems with matrices from the collection of the University of Florida are presented.     

Evaluating the robustness of temporal networks considering spatiality of connections

Network robustness has been a hot research area of studies on complex networks. Finding out the explanations behind the phenomena that networked systems can still function efficiently after some structural damages or the malfunction of certain nodes is meaningful to both the design of solid systems and the defend against failures. It is still indistinct what kind of resilience networked systems which change their topological structures incessantly over time might have. Nevertheless, earlier studies have frequently overlooked to consider the temporal characteristics which in many real scenarios are of great concern, or have considered only the temporality without spatiality which is not reasonable in the real world case. In this paper, we first take the spatiality of connections and communications between nodes, except for the temporal ordering of connection events which has solely been noticed by previous studies, into consideration for measuring and assessing the robustness of the temporal network. We propose a novel temporal efficiency metric, and correspondingly, develop a new temporal robustness evaluation method for temporal network models. The proposed metric and method show their validity through numerical simulations of three temporal network models and we give our evaluations and discussions.     

A Lagrangian relax-and-cut approach for the sequential ordering problem with precedence relationships

The sequential ordering problem with precedence relationships was introduced in Escudero [7]. It has a broad range of applications, mainly in production planning for manufacturing systems. The problem consists of finding a minimum weight Hamiltonian path on a directed graph with weights on the arcs, subject to precedence relationships among nodes. Nodes represent jobs (to be processed on a single machine), arcs represent sequencing of the jobs, and the weights are sums of processing and setup times. We introduce a formulation for the constrained minimum weight Hamiltonian path problem. We also define Lagrangian relaxation for obtaining strong lower bounds on the makespan, and valid cuts for further tightening of the lower bounds. Computational experience is given for real-life cases already reported in the literature.     

On a binary distance model for the minimum linear arrangement problem

The minimum linear arrangement problem consists of finding an embedding of the nodes of a graph on the line such that the sum of the resulting edge lengths is minimized. The problem is among the classical NP-hard optimization problems and there has been extensive research on exact and approximative algorithms. In this paper, we introduce a new model based on binary variables d _ijk that are equal to 1 if nodes i and j have distance k in the ordering. We analyze this model and point to connections and differences to a model using integer distance variables. Based on computational experiments, we argue that our model is worth further theoretical and practical investigation and that is has potentials yet to be examined.     

Short containers in Cayley graphs

The star diameter of a graph measures the minimum distance from any source node to several other target nodes in the graph. For a class of Cayley graphs from abelian groups, a good upper bound for their star diameters is given in terms of the usual diameters and the orders of elements in the generating subsets. This bound is tight for several classes of graphs including hypercubes and directed n-dimensional tori. The technique used is the so-called disjoint ordering for a system of subsets, due to Gao, Novick and Qiu [S. Gao, B. Novick, K. Qiu, From Hall’s matching theorem to optimal routing on hypercubes, J. Comb. Theory B 74 (1998) 291-301].     

关于DMRL序及其相关序的若干性质

证明了DMRL偏序关系在平移和尺度变换下的不变性,并获得了一个充分必要条件.同时考虑了DMRL序与IFR及IFRA序之间的关系.     

The failure rate and likelihood ratio orderings of standby redundant systems

There are various notions of partial ordering between lifetimes of systems; stochastic ordering, failure rate ordering, and likelihood ratio ordering. In this paper we show that for series systems with noni.i.d. exponential lifetimes of components, standby redundancy at component level is better than that at system level in failure rate ordering and likelihood ratio ordering. We also demonstrate that for 2-component parallel systems withi.i.d. exponential lifetimes of components, standby system redundancy is better than standby component redundancy in failure rate ordering and likelihood ratio ordering.     

Parallel algorithms for analyzing activity networks

Parallel algorithms for analyzing activity networks are proposed which include feasibility test, topological ordering of the events, and computing the earliest and latest start times for all activities and hence identification of the critical activities of the activity network. The first two algorithms haveO(logn) time complexity and the remaining one achievesO(logd log logn) time bound, whered is the diameter of the digraph representing the activity network withn nodes. All these algorithms work on a CRCW PRAM and requireO(n ³) processors.     

Ordering fuzzy sets over the real line: An approach based on decision making under uncertainty

The ordering of fuzzy sets over the real line is approached from the point of view of ordering intervals rather than ordering numbers. First, the maximax and maximin criteria which are commonly used for ordering intervals are expressed in terms of characteristic functions. These criteria and the Hurwicz criterion for decision making under complete ignorance are then reformulated in a manner that allows for their generalization to the fuzzy case. Transitivity is established for these ordering rules. A criterion based on the principle of diminishing marginal utility is also presented.     

A group majorization ordering for Euclidean distance matrices

This paper investigates some properties of Euclidean distance matrices (EDMs) with focus on their ordering structure. The ordering treated here is the group majorization ordering induced by the group of permutation matrices. By using this notion, we establish two monotonicity results for EDMs: (i) The radius of a spherical Euclidean distance matrix (spherical EDM) is increasing with respect to the group majorization ordering. (ii) The larger an EDM is in terms of the group majorization ordering, the more spread out its eigenvalues are. Minimal elements with respect to this ordering are also described.