173 search results - page 7 / 35 » Bounds and Heuristics for the Shortest Capacitated Paths Pro... |
BMCBI
2006
13 years 7 months ago
2006
Background: The problem of finding a Shortest Common Supersequence (SCS) of a set of sequences is an important problem with applications in many areas. It is a key problem in biol...
ORL
2008
13 years 7 months ago
2008
This paper focuses on tractable instances of interval data minmax regret graph problems. More precisely, we provide polynomial and pseudopolynomial algorithms for sets of particul...
TON
2008
13 years 7 months ago
2008
Abstract-- Computing constrained shortest paths is fundamental to some important network functions such as QoS routing, which is to find the cheapest path that satisfies certain co...
INFOCOM
2008
IEEE
14 years 1 months ago
2008
IEEE
Abstract—MPLS recovery mechanisms are increasing in popularity because they can guarantee fast restoration and high QoS assurance. Their main advantage is that their backup paths...
NETWORKS
2007
13 years 7 months ago
2007
The Internet Protocol Network Design Problem with Reliability and Routing Constraints (IPRR) can be shortly stated as follows. A telecommunication network is given in terms of a s...