434 search results - page 44 / 87 » Improved Algorithms for the 2-Vertex Disjoint Paths Problem |
CN
2008
14 years 12 months ago
2008
Failure resilience is a desired feature of the Internet. Most traditional restoration architectures assume single-failure assumption, which is not adequate in present day WDM opti...
103
click to vote
ATAL
2010
Springer
15 years 27 days ago
2010
Springer
A major research challenge in multi-agent systems is the problem of partitioning a set of agents into mutually disjoint coalitions, such that the overall performance of the system...
100
click to vote
FOCS
2008
IEEE
15 years 6 months ago
2008
IEEE
In the Survivable Network Design Problem (SNDP) the goal is to find a minimum cost subset of edges that satisfies a given set of pairwise connectivity requirements among the ver...
INFOCOM
2006
IEEE
15 years 5 months ago
2006
IEEE
— Multihoming has been used by stub networks for several years as a form of redundancy, improving the availability of Internet access. More recently, Intelligent Route Control (I...
EVOW
2004
Springer
15 years 5 months ago
2004
Springer
We consider the problem of designing error correcting codes (ECC), a hard combinatorial optimization problem of relevance in the field of telecommunications. This problem is tackl...