A linear time 5/3-approximation algorithm is presented for the NP-hard problem of finding a minimum strongly-connected spanning subgraph. It is based...

We show that the projective norm-graphs of Alon et al. [J. Combin. Theory Ser. B 76 (1999) 280–290] are pseudorandom in the sense that their second ei...

We prove a lower bound of where for the hitting set size for combinatorial rectangles of volume at least in [m]d space, for and d>2.

This work deals with the domination numbers of generalized de Bruijn digraphs and generalized Kautz digraphs. Dominating sets for digraphs are not fam...

In this paper we study a particular type of vehicle routing problem that arises in the context of scheduling an automatic guided vehicle (AGV) in the...