Sciweavers

55 search results - page 9 / 11
» Improved bounds for vehicle routing solutions
Sort
View
ICCAD
2008
IEEE
170views Hardware» more  ICCAD 2008»
14 years 2 months ago
Obstacle-avoiding rectilinear Steiner tree construction
— In today’s VLSI designs, there can be many blockages in a routing region. The obstacle-avoiding rectilinear Steiner minimum tree (OARSMT) problem has become an important prob...
Liang Li, Evangeline F. Y. Young
JSAC
2006
146views more  JSAC 2006»
13 years 5 months ago
Joint Channel Assignment and Routing for Throughput Optimization in Multiradio Wireless Mesh Networks
Multihop infrastructure wireless mesh networks offer increased reliability, coverage, and reduced equipment costs over their single-hop counterpart, wireless local area networks. E...
Mansoor Alicherry, Randeep Bhatia, Erran L. Li
ICALP
2005
Springer
13 years 11 months ago
New Approaches for Virtual Private Network Design
Virtual Private Network Design is the following NP-hard problem. We are given a communication network, represented as a weighted graph with thresholds on the nodes which represent...
Friedrich Eisenbrand, Fabrizio Grandoni, Gianpaolo...
TON
2008
109views more  TON 2008»
13 years 5 months ago
Efficient routing in intermittently connected mobile networks: the single-copy case
Abstract--Intermittently connected mobile networks are wireless networks where most of the time there does not exist a complete path from the source to the destination. There are m...
Thrasyvoulos Spyropoulos, Konstantinos Psounis, Ca...
JCP
2008
117views more  JCP 2008»
13 years 5 months ago
Selfish Constraint Satisfaction Genetic Algorithm for Planning a Long-distance Transportation Network
To build a cooperative logistics network covering multiple enterprises, a planning method that can build a long-distance transportation network is required. Many strict constraints...
Takashi Onoyama, Takuya Maekawa, Yoshitaka Sakurai...