Abstract. Determining the integrality gap of the bidirected cut relaxation for the metric Steiner tree problem, and exploiting it algorithmically, is a long-standing open problem. ...
Deeparnab Chakrabarty, Nikhil R. Devanur, Vijay V....
This paper concerns the capacity of the discrete noiseless channel introduced by Shannon. A sufficient condition is given for the capacity to be well-defined. For a general discre...
Abstract--This paper centers on the limit eigenvalue distribution for random Vandermonde matrices with unit magnitude complex entries. The phases of the entries are chosen independ...
In spite of enormous previous efforts to model the growth of various networks, there have only been a few works that successfully describe the evolution of latent networks. In a l...
The complexity and detail of geometric scenes that are used in today’s computer animated films and interactive games have reached a level where the manual creation by tradition...