4 search results - page 1 / 1 » A fast bipartite network flow algorithm for selective assemb... |
ORL
1998
13 years 4 months ago
1998
Bipartite network flow problems naturally arise in applications such as selective assembly and preemptive scheduling. This paper presents fast algorithms for these problems that ...
BROADNETS
2007
IEEE
13 years 11 months ago
2007
IEEE
— Traffic engineering has been extensively studied to maximize network resource utilization while minimizing call blocking [1]. As the the demand for high data rate services ove...
INFOCOM
2002
IEEE
13 years 9 months ago
2002
IEEE
Abstract—Routing with service restorability is of much importance in Multi-Protocol Label Switched (MPLS) networks, and is a necessity in optical networks. For restoration, each ...
PERCOM
2010
ACM
13 years 3 months ago
2010
ACM
In this paper, we explore how to effectively create and use "instant mesh networks", i.e., wireless mesh networks that are dynamically deployed in temporary circumstances...