Within the last year
Within the past 3 years
1 - 10 of 11 articles
We consider the infinite one-sided sequence generated by the period-doubling substitution. The number p ( n ) of palindromes of length n and the number b k ( n ) of k th powers of words of length n occurring in this sequence are computed explicitly.
The paper considers the classic linear assignment problem with a min-sum objective function, and the most efficient and easily available codes for its solution. We first give a survey describing the different approaches in the literature, presenting their implementations, and pointing out...
The problem of determining the maximum number of vertex-disjoint subgraphs of a biconnected outerplanar graph H on n h vertices isomorphic to a “pattern” biconnected outerplanar graph G on n g vertices is shown to be solvable in time O(( n h n g ) 2 ).
Recently, Nagamochi and Ibaraki have introduced a concept of posi-modular set function and considered the structure of the polyhedron described by an intersecting submodular and posi-modular function. They showed that the facets of the polyhedron form a laminar family. We show that such a...
This paper describes Fortran subroutines for computing approximate solutions to the weighted MAX-SAT problem using a greedy randomized adaptive search procedure (GRASP). The algorithm (Resende, Pitsoulis, and Pardalos, in: D.Z. Du et al. (Ed.), Satisfiability problem: Theory and Applications,...
In this paper, we present several characterizations of the classes of naturally submodular digraphs and naturally submodular bi-directed graphs. For each class, one characterization is given in terms of forbidden digraph configurations and the other in terms of graph decomposition. For the class...
The purpose of this note is to point out that if there are some machines that do not process any job and hence is inactive in the planning horizon then the lower bound of makespan provided by Lee (1991) in the above mentioned paper may not be a valid one. Furthermore, the error bound of applying...
Periodicity of vector orbits in max–min algebra is studied. It is proved that computing the coordinate-orbit period is NP-hard, while the orbit period can be computed in O( n 4 ) time. A related problem of maximum sequence period is shown to be NP-complete.
The complexity status of unit time open shop with release dates and the minimal number of late jobs criterion is investigated here. It is shown by reduction from 3-partition, that this problem is unary NP-hard.
We consider the problem of broadcasting multiple messages from one processor to many processors in telephone-like communication systems. In such systems, processors communicate in rounds, where in every round, each processor can communicate with exactly one other processor by exchanging messages...
Read and print from thousands of top scholarly journals.
Sign up with Facebook
Sign up with Google
Already have an account? Log in
Save this article to read later. You can see your Read Later on your DeepDyve homepage.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Sign Up Log In
To subscribe to email alerts, please log in first, or sign up for a DeepDyve account if you don’t already have one.
To get new article updates from a journal on your personalized homepage, please log in first, or sign up for a DeepDyve account if you don’t already have one.