Given a network and a set of connection requests on it, we consider the maximum edge-disjoint paths and related generalizations and routing problems that arise in assigning paths f...
The present paper deals with the problem of calculating queue length distributions in a polling model with (exhaustive) k-limited service under the assumption of general arrival, ...
This article shows that, so called, general Green-Taylor solutions, also called Taylor solutions or eddy solutions of the 2d Navier Stokes equations are also exact solutions to app...
—The capacity region of multihop wireless network is involved in many capacity optimization problems. However, the membership of the capacity region is NP-complete in general, an...
Peng-Jun Wan, Lixin Wang, Ai Huang, Minming Li, F....
We study approximation solutions for the densest k-subgraph problem (DS-k) on several classes of intersection graphs. We adopt the concept of -quasi elimination orders, introduced ...