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...
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...
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...
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...
The Shortest Common Supersequence problem is a hard combinatorial optimization problem with numerous practical applications. Several evolutionary approaches are proposed for this p...