434 search results - page 19 / 87 » Improved Algorithms for the 2-Vertex Disjoint Paths Problem |
GLOBECOM
2007
IEEE
15 years 3 months ago
2007
IEEE
—In hybrid Optical/packet networks, wavelength and VLAN tag continuity along a Label Switched Path are two common constraints. These two types of constraints, referred to as Gene...
101
click to vote
CORR
2008
Springer
14 years 9 months ago
2008
Springer
This paper presents improved approximation algorithms for the problem of multiprocessor scheduling under uncertainty (SUU), in which the execution of each job may fail probabilist...
92
Voted
MOBIHOC
2008
ACM
15 years 9 months ago
2008
ACM
Constructing sensor barriers to detect intruders crossing a randomly-deployed sensor network is an important problem. Early results have shown how to construct sensor barriers to ...
109
Voted
SODA
2012
ACM
12 years 12 months ago
2012
ACM
Given an integer h, a graph G = (V, E) with arbitrary positive edge capacities and k pairs of vertices (s1, t1), (s2, t2), . . . , (sk, tk), called terminals, an h-route cut is a ...
INFOCOM
2005
IEEE
15 years 3 months ago
2005
IEEE
Abstract— The current best-effort Internet cannot readily provide the service guarantees that VoIP applications often require. Path switching can potentially address this problem...