Given a sequencing of jobs on a single machine, each one with a weight, processing time, and a due date, the tardiness of a job is the time needed for its completion beyond its du...
George Karakostas, Stavros G. Kolliopoulos, Jing W...
Abstract. We consider the problem of highly space-efficient representation of separable graphs while supporting queries in constant time in the RAM with logarithmic word size. In p...
A binary matrix has the Consecutive-Ones Property (C1P) if its columns can be ordered in such a way that all 1’s in each row are consecutive. We consider here a variant of the C1...
abstract appeared in: Proc. of 7th Ann. Int. Computing and Combinatorics Conference, COCOON 2001 (ed. J. Wang), Lecture Notes in Computer Science Vol. 2108, Springer-Verlag, Berlin...
With a graph G = (V, E) we associate a collection of non-negative real weights vV {i,v : 1 i m} uvE{ij,uv : 1 i j m}. We consider the probability distribution on {f : V {1,...