Sciweavers

11371 search results - page 114 / 2275
» The network inhibition problem
Sort
View
JAL
2002
71views more  JAL 2002»
15 years 6 months ago
A primal-dual schema based approximation algorithm for the element connectivity problem
The element connectivity problem falls in the category of survivable network design problems { it is intermediate to the versions that ask for edge-disjoint and vertex-disjoint pa...
Kamal Jain, Ion I. Mandoiu, Vijay V. Vazirani, Dav...
CEC
2010
IEEE
15 years 4 months ago
The one-commodity traveling salesman problem with selective pickup and delivery: An ant colony approach
We introduce a novel combinatorial optimization problem: the one-commodity traveling salesman problem with selective pickup and delivery (1-TSP-SELPD), characterized by the fact th...
Rafael Falcón, Xu Li, Amiya Nayak, Ivan Sto...
FC
2004
Springer
94views Cryptology» more  FC 2004»
15 years 12 months ago
The Ephemeral Pairing Problem
Abstract In wireless ad-hoc broadcast networks the pairing problem consists of establishing a (long-term) connection between two specific physical nodes in the network that do not...
Jaap-Henk Hoepman
ICNP
2002
IEEE
15 years 11 months ago
Analysis of the MED Oscillation Problem in BGP
The Multi Exit Discriminator (MED) attribute of the Border Gateway Protocol (BGP) is widely used to implement “cold potato routing” between autonomous systems. However, the us...
Timothy Griffin, Gordon T. Wilfong
IWANN
2005
Springer
15 years 12 months ago
A Comparison of Evolutionary Approaches to the Shortest Common Supersequence Problem
The Shortest Common Supersequence problem is a hard combinatorial optimization problem with numerous practical applications. Several evolutionary approaches are proposed for this p...
Carlos Cotta