Sciweavers

12 search results - page 2 / 3
» Minimum cost capacity installation for multicommodity networ...
Sort
View
ICWN
2004
13 years 6 months ago
Efficient Minimum-Cost Bandwidth-Constrained Routing in Wireless Sensor Networks
A critical issue in the design of routing protocols for wireless sensor networks is the efficient utilization of resources such as scarce bandwidth and limited energy supply. Many ...
Maulin Patel, R. Chandrasekaran, S. Venkatesan
HEURISTICS
2002
155views more  HEURISTICS 2002»
13 years 5 months ago
Bounds and Heuristics for the Shortest Capacitated Paths Problem
Given a graph G, the Shortest Capacitated Paths Problem (SCPP) consists of determining a set of paths of least total length, linking given pairs of vertices in G, and satisfying c...
Marie-Christine Costa, Alain Hertz, Michel Mittaz
TAMC
2009
Springer
13 years 12 months ago
A Simple Greedy Algorithm for the k-Disjoint Flow Problem
In classical network flow theory the choice of paths, on which flow is sent, is only restricted by arc capacities. This, however, is not realistic in most applications. Many prob...
Maren Martens
CIAC
2006
Springer
103views Algorithms» more  CIAC 2006»
13 years 9 months ago
Provisioning a Virtual Private Network Under the Presence of Non-communicating Groups
Virtual private network design in the hose model deals with the reservation of capacities in a weighted graph such that the terminals in this network can communicate with one anoth...
Friedrich Eisenbrand, Edda Happ
TRANSCI
2008
108views more  TRANSCI 2008»
13 years 5 months ago
Per-Seat, On-Demand Air Transportation Part II: Parallel Local Search
The availability of relatively cheap small jet aircrafts suggests a new air transportation business: dial-a-flight, an on-demand service in which travelers call a few days in adva...
Daniel G. Espinoza, R. Garcia, Marcos Goycoolea, G...