Sciweavers

SODA
2012
ACM
205views Algorithms» more  SODA 2012»
12 years 1 months ago
Approximate duality of multicommodity multiroute flows and cuts: single source case
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 ...
Petr Kolman, Christian Scheideler
CJ
2011
13 years 3 months ago
Dynamic Multipath Allocation in Ad Hoc Networks
Ad Hoc networks are characterized by fast dynamic changes in the topology of the network. A known technique to improve QoS is to use Multipath routing where packets (voice/video/â...
Yosi Ben-Asher, Sharoni Feldman, Moran Feldman
SIAMCOMP
2010
120views more  SIAMCOMP 2010»
13 years 10 months ago
Edge Disjoint Paths in Moderately Connected Graphs
Abstract. We study the Edge Disjoint Paths (EDP) problem in undirected graphs: Given a graph G with n nodes and a set T of pairs of terminals, connect as many terminal pairs as pos...
Satish Rao, Shuheng Zhou
JCT
2006
79views more  JCT 2006»
13 years 11 months ago
A class of perfectly contractile graphs
We consider the class A of graphs that contain no odd hole, no antihole, and no "prism" (a graph consisting of two disjoint triangles with three disjoint paths between th...
Frédéric Maffray, Nicolas Trotignon
APPROX
2010
Springer
138views Algorithms» more  APPROX 2010»
14 years 1 months ago
Maximum Flows on Disjoint Paths
We consider the question: What is the maximum flow achievable in a network if the flow must be decomposable into a collection of edgedisjoint paths? Equivalently, we wish to find a...
Guyslain Naves, Nicolas Sonnerat, Adrian Vetta
AAIM
2007
Springer
123views Algorithms» more  AAIM 2007»
14 years 3 months ago
Efficient Algorithms for k -Disjoint Paths Problems on DAGs
Given an acyclic directed graph and two distinct nodes s and t, we consider the problem of finding k disjoint paths from s to t satisfying some objective. We consider four objectiv...
Rudolf Fleischer, Qi Ge, Jian Li, Hong Zhu
ISAAC
1997
Springer
114views Algorithms» more  ISAAC 1997»
14 years 3 months ago
Algorithms for Finding Optimal Disjoint Paths Around a Rectangle
We give algorithms to ï¬nd the optimal disjoint paths around a rectangle. The set of disjoint paths connects a set of sources to a set of sinks (no ï¬xed pairing between the sour...
Wun-Tat Chan, Francis Y. L. Chin
INFOCOM
1997
IEEE
14 years 3 months ago
Addressing Network Survivability Issues by Finding the K-Best Paths through a Trellis Graph
Due to the increasing reliance of our society on the timely and reliable transfer of large quantities of information (suchas voice, data, and video)across high speed communication...
Stavros D. Nikolopoulos, Andreas Pitsillides, Davi...
SPAA
2003
ACM
14 years 4 months ago
Short length menger's theorem and reliable optical routing
In the minimum path coloring problem, we are given a graph and a set of pairs of vertices of the graph and we are asked to connect the pairs by colored paths in such a way that pa...
Amitabha Bagchi, Amitabh Chaudhary, Petr Kolman
ISPAN
2005
IEEE
14 years 5 months ago
Minimum Cost Paths Subject to Minimum Vulnerability for Reliable Communications
Abstract—In real networks, disjoint paths are needed for providing protection against single link/node failure. When disjoint paths cannot be found, an alternative solution is to...
Bing Yang, Mei Yang, Jianping Wang, S. Q. Zheng