3678 search results - page 343 / 736 » On the Stable Paths Problem |
173
click to vote
STACS
2007
Springer
16 years 27 days ago
2007
Springer
Abstract. We study computationally hard combinatorial problems arising from the important engineering question of how to maximize the number of connections that can be simultaneous...
204
click to vote
WAOA
2005
Springer
16 years 8 days ago
2005
Springer
Given a graph with a source and a sink node, the NP–hard maximum k–splittable flow (MkSF) problem is to find a flow of maximum value with a flow decomposition using at most...
215
click to vote
INFOCOM
2002
IEEE
15 years 11 months ago
2002
IEEE
—Open Shortest Path First (OSPF) is a popular protocol for routing within an autonomous system (AS) domain. In order to scale for large networks containing hundreds and thousands...
180
click to vote
TON
2008
15 years 6 months ago
2008
We study the multi-constrained Quality-of-Service (QoS) routing problem where one seeks to find a path from a source to a destination in the presence of K 2 additive end-to-end Qo...
182
click to vote
ICPP
2009
IEEE
16 years 1 months ago
2009
IEEE
Abstract—When applied in a commercial deployment, DHTbased P2P protocols face a dilemma: although most real-world participants are so unstable that the maintenance overhead is pr...