We consider the minimum cost spanning tree problem under the restriction that all degrees must be at most a given value k. We show that we can efficiently find a spanning tree o...
We prove an upper bound, tight up to a factor of 2, for the number of vertices of level at most in an arrangement of n halfspaces in Rd , for arbitrary n and d (in particular, the...
In this paper we consider a general class of single-server multiqueue systems in which the stability of any single queue can be essentially determined by the queue’s arrival rat...
Connectivity in mobile wireless ad-hoc networks is maintained by setting the transmission range so that a node can establish a link to any other node in the network either directl...
Maen M. Artimy, William J. Phillips, William Rober...
We propose a new topological data structure for representing a set of polygonal curves embedded in a meshed surface. In this embedding, the vertices of the curve do not necessaril...