1639 search results - page 1 / 328 » Degree-constrained network flows |
GECCO
1999
Springer
13 years 9 months ago
1999
Springer
The design and development of network infrastructure to support mission-critical operations has become a critical and complicated issue. In this study we explore the use of geneti...
FGCN
2008
IEEE
13 years 11 months ago
2008
IEEE
This paper addresses the routing problem in packet switching free-space optical (FSO) mesh networks. FSO mesh networks are emerging as broadband communication networks because of ...
INFOCOM
1995
IEEE
13 years 8 months ago
1995
IEEE
Establishing a multicast tree in a point-to-point network of switch nodes, such as a wide-area ATM network, is often modeled as the NP-complete Steiner problem in networks. In thi...
APPROX
2008
Springer
13 years 6 months ago
2008
Springer
Given a graph H = (V, F) with edge weights {w(e) : e F}, the weighted degree of a node v in H is {w(vu) : vu F}. We give bicriteria approximation algorithms for problems that see...
ESA
2005
Springer
13 years 10 months ago
2005
Springer
Abstract. Traditional shortest path problems play a central role in both the design and use of communication networks and have been studied extensively. In this work, we consider a...