Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 20 of 29 for “"Disjoint Paths"”.
-
Approximation algorithms for disjoint paths problems
Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 1996.
-
Algorithms for flows and disjoint paths in planar graphs
… for computing flows, connectivity, and disjoint paths in planar graphs. In all cases, the algorithms are either the first polynomial-time algorithms or are faster than all previously-known algorithms. First, we describe algorithms for the maximum flow problem in directed planar graphs …
-
Reliability and energy-efficiency in wireless ad-hoc networks
… of simultaneously routing data along multiple disjoint paths from a source to destination in the most energy efficient manner. To this end, we developed and analyzed both optimal and heuristic algorithms that find minimum energy node and link disjoint paths in a wireless ad hoc network. Our …
-
Near-optimal broadcast in all-port wormhole-routed hypercubes using error-correcting codes
… hypercube. Once stations are identified, node disjoint paths are formed from the source to all stations. The broadcasting is accomplished first by sending the message to all stations, which will inform the rest of the nodes. To establish node-disjoint paths between the source node and all …
-
A framework for reliable and dynamic wireless sensor-actuator networks
… if it is biconnected. At least two node-disjoint paths between every pair of nodes have to exist within the network. The main contributions of this thesis are threefold. First, an algorithm for the generation of fault-tolerant networks for given floor plans is provided. The generated …
-
Survivable paths in multilayer networks
… networks. In single-layer net- works, a pair of disjoint paths can be used to provide protection for a source-destination pair. However, this approach cannot be directly applied to layered networks where disjoint paths may not always exist. In this thesis, we take a new approach which is based on …
-
Linear-time algorithms for graphs with bounded branchwidth
… CUT, GRAPH COLORING, HAMILTONIAN CYCLE, and DISJOINT PATHS). The linearity is achieved assuming the provision of a branch decomposition of the instance graph. We then modify the framework to create a multithreaded framework that uses the existing problem-specific extensions without any …
-
Survivable network design problems with element and vertex connectivity requirements
… and v represents the required number of element-disjoint paths between the two vertices. The elements are made up of all the edges and unreliable vertices. This way of defining connectivity models networks where links and nodes can both fail. For Elem-SNDP, our algorithm outputs a solution that …
-
Analysis and Optimization of Communication Networks with Flow Requirements
… when each pair of vertices has k edge disjoint or internally disjoint paths, respectively, connecting them in the surviving subnetwork. Thus, the property of being operating covers the connectivity of the surviving graph together with some minimum bandwidth. We study essential and …
-
Problems in Sorting and Graph Algorithms
Five disjoint problems are discussed. The first problem concerns the determination of optimal algorithms with respect to a new model for evaluating sorting algorithms. We did an exhaustive search for such algorithms. The second problem concerns a conjecture that every sorting algorithm on some …
-
Trajectory planning in the presence of risk regions
… algorithms for computing short collision-free paths for aerial vehicles in the presence of obstacles and enemy radar installations. When aerial vehicles are deployed in such regions, it is critical to compute admissible paths having reduced exposure to threats. The generalized version of this …
-
High throughput path selection for unstructured data center networks
… on path selection, our experiments show that k-disjoint paths provide much better throughput in most topologies than the previously used k-shortest paths. We also show that one can positively impact network throughput by varying the number of paths according to network density.
-
ALGORITHMS FOR ROUTING AND CHANNEL ASSIGNMENT IN WIRELESS INFRASTRUCTURE NETWORKS
… sharing. Benefits of multiple paths between a source-destination pairmotivates the problem of computing multiple paths between a source-destinationpair with channel assignment such that all the paths can be active simultaneouslyto achieve maximal flow between the pair in the …
-
Node-weighted prize-collecting survivable network design problems
… for each pair $st$, $H$ contains $r(st)$ \emph{disjoint} paths between $s$ and $t$. PC-SNDP is a generalization in which the input also includes a penalty $\pi(st)$ for each pair, and the goal is to find a subgraph $H$ to minimize the sum of the weight of $H$ and the sum of the penalties for all …
-
Approximation algorithms for the minimum congestion routing problem via k-route flows
… defined as a flow of 1 unit along each of k edge-disjoint s-t paths. A k-route flow, first introduced as a concept by Kishimoto, is defined as a non-negative linear sum of elementary k-flows. In this thesis, the study of k-route flows is extended by presenting efficient algorithms to calculate …
-
Multipath routing and quality of service support for mobile ad hoc networks
… routing allows the establishment of multiple paths for routing between a source-destination pair. Multipath routing exploits the resource redundancy and diversity in the underlying network to provide benefits such as fault tolerance, load balancing, capacity aggregation and the improvement in …
-
Conexão de terminais com limitação de roteadores: complexidade e relação com fluxos e caminhos disjuntos
… r ≥ 2, exposing relations with network flows and disjoint paths. Moreover, we determine the complexity of some variants of the S-TCP. Lastly, we study the S-TCP and the TCP when the maximum degree of the graph G is bounded.
-
Extremal and Structural Problems of Graphs
… of its vertices there exist a collection of edge-disjoint paths routing the the vertices of each pair. A question we are concerned here asks whether every planar path pairable graph on $n$ vertices must possess a vertex of degree linear in $n$. Indeed, we answer this question in the affirmative. …
-
Algorithms and complexity analyses for some combinational optimization problems
… u,v is joined by at least r_{uv} edge (vertex)-disjoint paths. A Polynomial Time Approximation Scheme (PTAS) is designed for the problem when the graph is Euclidean and the connectivity requirement of any point is at most 2. PTASs or Quasi-PTASs are also designed for 2-edge-connectivity problem …
-
Novel localised quality of service routing algorithms. Performance evaluation of some new localised quality of service routing algorithms based on bandwidth and delay as the metrics for candidate path selection.
… probability as a factor in selecting the routing paths and work with either credit or flow proportion respectively, which makes impossible having up-to-date information. Therefore our proposed Highest Minimum Bandwidth (HMB) and Highest Average Bottleneck Bandwidth History (HABBH) algorithms …
Page 1 of 2