In this work, we study an extension of the k-center facility location problem, where centers are required to service a minimum of clients. This problem is motivated by requirement...
In this paper we introduce a notion of a regular expression over infinite alphabets and show that a language is definable by an infinite alphabet regular expression if and only if ...
The problem of efficiently monitoring the network flow is regarded as the one to find out the minimum weighted weak vertex cover set for a given graph G = (V, E) with weight func...
We consider the fault hamiltonian properties of m×n meshes with two wraparound edges in the first row and the last row, denoted by M2(m, n), m ≥ 2, n ≥ 3. M2(m, n) is a spann...
Kyoung-Wook Park, Hyeong-Seok Lim, Jung-Heum Park,...
Abstract. The supply chain between manufacturers and retailers always includes transshipments through a network of locations. A major challenge in making demand meet supply has bee...
Andrew Lim, Zhaowei Miao, Brian Rodrigues, Zhou Xu