3678 search results - page 40 / 736 » On the Stable Paths Problem |
NHM
2010
13 years 4 months ago
2010
We introduce the coolest path problem, which is a mixture of two well-known problems from distinct mathematical fields. One of them is the shortest path problem from combinatorial ...
SODA
2010
ACM
14 years 7 months ago
2010
ACM
We consider the following well-known problem, which is called the edge-disjoint paths problem. Input: A graph G with n vertices and m edges, k pairs of vertices (s1, t1), (s2, t2)...
QSHINE
2005
IEEE
14 years 3 months ago
2005
IEEE
An extended depth-first-search (EDFS) algorithm is proposed to solve the multi-constrained path (MCP) problem in quality-of-service (QoS) routing, which is NP-Complete when the n...
SODA
2010
ACM
14 years 7 months ago
2010
ACM
We study integrality gaps and approximability of two closely related problems on directed graphs. Given a set V of n nodes in an underlying asymmetric metric and two specified nod...
WIOPT
2006
IEEE
14 years 3 months ago
2006
IEEE
Abstract— The inherent nature of the physical setup and transmission mechanism in wireless ad hoc networks with random channel access, results in correlation between the link met...